PAT A1033. Splitting A Linked List (25)

1. Splitting A Linked List (25)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those greater than K. The order of the elements inside each class must not be changed. For example, given the list being 18→7→-4→0→5→-6→10→11→-2 and K being 10, you must output -4→-6→-2→7→0→5→10→18→11.

Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (<= 105) which is the total number of nodes, and a positive K (<=1000). The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then N lines follow, each describes a node in the format:

Address Data Next

where Address is the position of the node, Data is an integer in [-105, 105], and Next is the position of the next node. It is guaranteed that the list is not empty.

Output Specification:

For each case, output in order (from beginning to the end of the list) the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:
00100 9 10
23333 10 27777
00000 0 99999
00100 18 12309
68237 -6 23333
33218 -4 00000
48652 -2 -1
99999 5 68237
27777 11 48652
12309 7 33218
Sample Output:
33218 -4 68237
68237 -6 48652
48652 -2 12309
12309 7 00000
00000 0 99999
99999 5 23333
23333 10 00100
00100 18 27777
27777 11 -1

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn=100010;

struct Node{
    int id;
    int data;
    int next;
    int flag;
    int mk;
}nodes[maxn];

int st,n,k;
bool cmp1(Node a,Node b){
    return a.flag<b.flag;
}
bool cmp2(Node a,Node b){
    return a.mk>b.mk;
}
int main(){
    scanf("%d %d %d",&st,&n,&k);
    for(int i=0;i<maxn;i++){
        nodes[i].flag=maxn;
        nodes[i].mk=0;
    }
    for(int i=0;i<n;i++){
        int id;
        scanf("%d",&id);
        scanf("%d %d",&nodes[id].data,&nodes[id].next);
        nodes[id].id=id;
    }
    int idx=st;
    int cnt=0;
    while(idx!=-1){
        nodes[idx].flag=cnt++;
        idx=nodes[idx].next;
    }
    sort(nodes,nodes+maxn,cmp1);
    for(int i=0;i<cnt;i++){
        if(nodes[i].data<0)nodes[i].mk=2;
        else if(nodes[i].data<=k)nodes[i].mk=1;
    }
    sort(nodes,nodes+cnt,cmp2);
    for(int i=0;i<cnt-1;i++){
        nodes[i].next=nodes[i+1].id;
    }
    nodes[cnt-1].next=-1;
    for(int i=0;i<cnt-1;i++){
        printf("%05d %d %05d\n",nodes[i].id,nodes[i].data,nodes[i].next);
    }
    printf("%05d %d %d\n",nodes[cnt-1].id,nodes[cnt-1].data,nodes[cnt-1].next);
    return 0;
}