L2-022 重排链表 (25 分)

#include<iostream>
#include<vector>
using namespace std;

#define MX 100010

int main(){
	int first, n;
	cin >> first >> n;
	vector<int> data(MX), next(MX);
	for (int i = 0; i < n;++i){
		int ads;
		cin >> ads>>data[ads]>>next[ads];
	}
	vector<int> v;
	while(first!=-1){
		v.push_back(first);
		first = next[first];
	}
	vector<int> a;
	int i=0, j = v.size()-1;
	while(i<=j){
		a.push_back(v[j--]);
		if(i>j)
			break;
		a.push_back(v[i++]);
	}
	int an = a.size();
	for (int i = 0; i < an-1;++i)
		printf("%05d %d %05d\n", a[i], data[a[i]], a[i + 1]);
	printf("%05d %d -1", a[an - 1], data[a[an - 1]]);
}