解题注意点:对于不在链表中的节点作抛弃处理,如果没有符合的节点输出0 -1.
代码如下:
#include<bits/stdc++.h>
#include<bits/stdc++.h>
#define lowbit(x) ((x)&(-(x)))
#define ll long long
#define INF 0x3f3f3f3f
#define CLR(a) memset(a, 0, sizeof(a))
using namespace std;
struct node{
int address,key,next;
int flag=0;
}p[100005];
int cmp(node a,node b){
if(a.flag==b.flag&&a.flag==1)//易错点,容易漏掉a.flag==1这个判定
return a.key<b.key;
else
return a.flag>b.flag;
}
int main() {
int n,head,address,key,next;
cin>>n>>head;
for(int i=0;i<n;i++){
cin>>address>>key>>next;
p[address].address=address;
p[address].key=key;
p[address].next=next;
}
int cnt=0;
for(int i=head;i!=-1;i=p[i].next){
p[i].flag=1;
cnt++;
}
if(cnt==0){
printf("0 -1\n");
}else{
sort(p,p+100005,cmp);
head=p[0].address;
printf("%d %05d\n",cnt,head);
for(int i=0;i<cnt-1;i++)
printf("%05d %d %05d\n",p[i].address,p[i].key,p[i+1].address);
printf("%05d %d -1\n",p[cnt-1].address,p[cnt-1].key);
}
return 0;
}