1133. Splitting A Linked List (25)

题目链接：1133. Splitting A Linked List (25)

#include<bits/stdc++.h>
const int maxn =100100;
using namespace std;
struct Node {
    int data,next;
}q[maxn];
int st,n,k,a;
vector<int>v[3];

int main(){
    scanf("%d%d%d",&st,&n,&k);
    for(int i=0;i<n;i++){
        scanf("%d",&a);
        scanf("%d%d",&q[a].data,&q[a].next);
    }
    int flag=0,data;
    int p=st;
    while(p!=-1){
        data=q[p].data;
        if(data<0)v[0].push_back(p);
        else if(data>=0&&data<=k)v[1].push_back(p);
        else v[2].push_back(p);
        p=q[p].next;
    }

    for(int i=0;i<3;i++){
        for(int j=0;j<v[i].size();j++){
            if(flag==0){
                flag=1;
                printf("%05d %d ",v[i][j],q[v[i][j]]);
            }
            else printf("%05d\n%05d %d ",v[i][j],v[i][j],q[v[i][j]]);
        }
    }
    printf("-1");
    return 0;
}