L2-002. 链表去重

L2-002. 链表去重

题目链接：https://www.patest.cn/contests/gplt/L2-002

代码如下：

#include<cstdio>
#include<cstring>
#include<cstring>
#include<stack>
#include<cmath>
#define MAX_N 100000
using namespace std;
struct TYPE{
    int vul,next;
};
TYPE a[MAX_N+1];
int x[MAX_N+1],y[MAX_N+1];
bool compare[MAX_N+1];
int main(void){
    //freopen("in.txt","r",stdin);
    int adress,n;
    scanf("%d%d",&adress,&n);
    for(int i=0;i<n;++i){
        int temp;
        scanf("%d",&temp);
        scanf("%d%d",&a[temp].vul,&a[temp].next);
    }
    int k1=0,k2=0;
    for(int i=adress;i!=-1;i=a[i].next){
        int temp=abs(a[i].vul);
        if(compare[temp]==false){
            x[k1++]=i;
            compare[temp]=true;
        }else{
            y[k2++]=i;
        }
    }
    printf("%05d %d ",x[0],a[x[0]].vul);
    for(int i=1;i<k1;++i){
        printf("%05d
",x[i]);
        printf("%05d %d ",x[i],a[x[i]].vul);
    }
    printf("-1
");
    if(k2){
        printf("%05d %d ",y[0],a[y[0]].vul);
        for(int i=1;i<k2;++i){
            printf("%05d
",y[i]);
            printf("%05d %d ",y[i],a[y[i]].vul);
        }
        printf("-1
");
    }
    return 0;
}