1097 Deduplication on a Linked List c++

#include
using namespace std;
struct node{
    int address;
    int key;
    int next;
}a[100001];
int main(){
	node head;cin>>head.next;

    int n;cin>>n;
    for(int i=0;i
        node temp;
        cin>>temp.address>>temp.key>>temp.next;
        a[temp.address]=temp;
    }
    vectorx;vectory;   //x装正常的节点，y装被删除的节点
    mapmp;
    node it=a[head.next];

    while(it.next!=-1){
        if(mp[abs(it.key)]==0){    
            mp[abs(it.key)]++;
            x.push_back(it);     //x装正常的节点
        }
        else{
            y.push_back(it);       //y装被删除的节点
        }
        it=a[it.next];
    }

    if(mp[abs(it.key)]==0){   //链表最后一个节点
        mp[abs(it.key)]++;
        x.push_back(it);
    }
    else
        y.push_back(it);


//打印输出
    if(x.size()!=0)
        x[x.size()-1].next=-1;
    for(int i=0;i
        if(x[i].next!=-1)
            printf("%05d %d %05dn",x[i].address,x[i].key,x[i+1].address);
        else
            printf("%05d %d %dn",x[i].address,x[i].key,x[i].next);
    }

    if(y.size()!=0)
        y[y.size()-1].next=-1;
    for(int i=0;i
        if(y[i].next!=-1)
            printf("%05d %d %05dn",y[i].address,y[i].key,y[i+1].address);
        else
            printf("%05d %d %dn",y[i].address,y[i].key,y[i].next);
    }
}