【PTA】7-3 链表去重--C++

#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
const int N=1e5+100;
int a[N],b[N],c[N]={0};//a不重，b重
struct biao{
    int q;
    int p;
}s[N];
int main(){
    int tou,n;
    cin>>tou>>n;
    int i;
      int x1,x2,x3;
    for(i=0;i<n;i++){
      cin>>x1>>x2>>x3;
        s[x1].q=x2;
        s[x1].p=x3;
    }
    
    int num=0;
      int j=0,k=0;
    
    for(i=tou;i!=-1;i=s[i].p){
        num=abs(s[i].q);
        if(c[num]==0){
            a[j++]=i;
        }
        else{
            b[k++]=i;
        }
        c[num]++;
    }
    for(i=0;i<j;i++){
        printf("%05d %d ",a[i],s[a[i]].q);
        if(i==j-1)printf("-1\n");
        else printf("%05d\n",a[i+1]);
    }
    for(i=0;i<k;i++){
        printf("%05d %d ",b[i],s[b[i]].q);
        if(i==k-1)printf("-1\n");
         else printf("%05d\n",b[i+1]);
    }
}