版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ccDLlyy/article/details/79943245
题目链接:点击打开链接
思路:水题,模拟即可。
#include <bits/stdc++.h>
using namespace std;
int head,data[100000],nex[100000];
vector<int> v1,v2;
set<int> s;
int main(){
int n,id;
scanf("%d%d",&head,&n);
for(int i = 0;i < n;i++){
scanf("%d",&id);
scanf("%d%d",&data[id],&nex[id]);
}
int now = head;
while(now != -1){
if(s.find(abs(data[now])) == s.end()){
v1.push_back(now);
s.insert(abs(data[now]));
}
else{
v2.push_back(now);
}
now = nex[now];
}
if(v1.size() > 0){
for(int i = 0;i < v1.size() - 1;i++){
printf("%05d %d %05d\n",v1[i],data[v1[i]],v1[i + 1]);
}
printf("%05d %d %d\n",v1[v1.size() - 1],data[v1[v1.size() - 1]],-1);
}
if(v2.size() > 0){
for(int i = 0;i < v2.size() - 1;i++){
printf("%05d %d %05d\n",v2[i],data[v2[i]],v2[i + 1]);
}
printf("%05d %d %d\n",v2[v2.size() - 1],data[v2[v2.size() - 1]],-1);
}
return 0;
}