L2-022 rearrange linked list (25 points) (map + structure simulation)

describe ：

Input ：

Each input contains 1 Test cases . Each test case is No 1 Line gives 1 Address of nodes and total number of nodes , Positive integer N ≤10⁵). The address of the node is 5 Bit nonnegative integer ,NULL Address use −1 Express .

Next there is N That's ok , The format of each line is ：

Address Data Next

among Address Is the node address ;Data Is the data saved in this node , For no more than 10 ⁵
The positive integer ;Next Is the address of the next node . The title ensures that there are at least two nodes in the list .

Output ：

For each test case , Output the rearranged result list in sequence , Each node on it occupies a row , The format is the same as the input .

The sample input ：

00100 6
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

Sample output ：

68237 6 00100
00100 1 99999
99999 5 12309
12309 2 00000
00000 4 33218
33218 3 -1

Be careful ：

Test point 31 started wrong , Give it a try , It is found that there is invalid data not in the linked list in the given address data , Correct it ;

/* 00100 6 00000 4 99999 00100 1 12309 33218 3 00000 99999 5 -1 12309 2 33218 sssss 6 sssss// Invalid data test  */

 #include<bits/stdc++.h>
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
 
const ll maxx = 1e18;
const int N = 1e6+100;
const int ps = 1e4+10;
const double eps = 1e-8;

string s1,ss;
int n,cnt;
pair<int,string>p;
map<string,pair<int,string>>mp;

struct node{
    
	string adds;
	int k;
}a[N];

int main()
{
    
	cin>>s1>>n;
	
	for(int i=1;i<=n;i++)
	{
    
		cin>>ss>>p.first>>p.second;
		mp[ss]=p;
	}// Record information 
	
	while(s1!="-1")
	{
    
		a[++cnt].adds=s1;
		a[cnt].k=mp[s1].first;
		s1=mp[s1].second;
	}// Store information in the structure 
	
	n=cnt;// hold  n  Replace with the effective number 
	
	if(n%2==0)
	{
    
		for(int i=1;i<=n/2;i++)
		{
    
			cout<<a[n-i+1].adds<<" "<<a[n-i+1].k<<" ";
			cout<<a[i].adds<<endl<<a[i].adds<<" "<<a[i].k<<" ";
			
			if(i!=n/2)
			cout<<a[n-i].adds<<endl;
			else
			cout<<"-1";
		}
	}
	else
	{
    
		for(int i=1;i<=n/2;i++)
		{
    
			cout<<a[n-i+1].adds<<" "<<a[n-i+1].k<<" ";
			cout<<a[i].adds<<endl<<a[i].adds<<" "<<a[i].k<<" ";
			cout<<a[n-i].adds<<endl;
		}
		cout<<a[n/2+1].adds<<" "<<a[n/2+1].k<<" "<<"-1";
	}
}// Output... In sequence