PAT乙级 1075.链表元素分类

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
struct node
{
    int data;
    int next;
}list1[100000];
vector<int> v[3];
int main()
{
    int start,n,k,a;
    scanf("%d%d%d",&start,&n,&k);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a);
        scanf("%d%d",&list1[a].data,&list1[a].next);
    }
    int p=start;
    while(p!=-1)
    {
        int data=list1[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=list1[p].next;
    }
    int flag=0;
    for(int i=0;i<3;i++)
    {
        for(int j=0;j<v[i].size();j++)
        {
            if(flag==0)
            {
                printf("%05d %d ",v[i][j],list1[v[i][j]].data);
                flag=1;
            }
            else
                printf("%05d\n%05d %d ",v[i][j],v[i][j],list1[v[i][j]].data);
        }
    }
    printf("-1");
    return 0;
}