PAT 1097

  
  

   
   #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
  
  
  
  

   
   const int maxn=100010;
  
  
  
  

   
   struct Node
{
 int address;
 int data;
 int next;
 int order;
}node[maxn]; 
  
  
  
  

   
   bool cmp(Node a,Node b)
{
 return a.order<b.order;
}
  
  
  
  

   
   bool k[10010]={false};
int main()
{
 for(int i=0;i<maxn;i++)
 {
  node[i].order=2*maxn;
 }
 int begin,num,address;
 scanf("%d%d",&begin,&num);
 for(int i=0;i<num;i++)
 {
  scanf("%d",&address);
  scanf("%d%d",&node[address].data,&node[address].next);
  node[address].address=address;
 }
  
  
  
  

   
    int countremoved=0,countvalid=0,count;
  
  
  
  

   
    for(int i=begin;i!=-1;i=node[i].next)
 {
  if(k[abs(node[i].data)]==false)//未出现过
  {
   countvalid++;
   node[i].order=countvalid;
   k[abs(node[i].data)]=true;
  }
  else
  {
   countremoved++;
   node[i].order=countremoved+maxn;
  }
 }
 sort(node,node+maxn,cmp);
  
  
  
  

   
    count=countvalid+countremoved;
 for(int i=0;i<count;i++)
 {
  if(i==countvalid-1||i==count-1)
  {
   printf("%05d %d -1\n",node[i].address,node[i].data);
  }
  else
  {
   printf("%05d %d %05d\n",node[i].address,node[i].data,node[i+1].address);
  }
 }
 system("pause");
 return 0;
}