注:如果链表为空,输出 “0 -1”
注2:应删除不在链表中的输入项
#include <stdio.h>
#include <deque>
#include <algorithm>
#define INC 100000
#define MAX 200001
using namespace std;
int main(int argc, char *argv[]) {
int n, start;
scanf("%d %d", &n, &start);
deque<int> q;
int next_add[MAX] = {0};
int key_add[MAX] = {0};
int add_key[MAX] = {0};
int address, key, next;
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &address, &key, &next);
next_add[address] = next;
key_add[key+INC] = address;
add_key[address] = key;
}
for (int i = start; i != -1; i = next_add[i]) {
q.push_back(add_key[i]);
}
if (q.size() == 0) {
printf("0 -1\n");
return 0;
}
sort(q.begin(), q.end());
printf("%d %05d\n", int(q.size()), key_add[q[0]+INC]);
for (int i = 0; i < q.size(); i++) {
if (i < q.size() - 1)
printf("%05d %d %05d\n", key_add[q[i]+INC], q[i], key_add[q[i+1]+INC]);
else
printf("%05d %d -1\n", key_add[q[i]+INC], q[i]);
}
return 0;
}