PAT_甲级_C++|静态链表|1052 Linked List Sorting (25分)

/*
For each case, the first line contains a positive N (<10^5) and an address of the head node,
5 00001
//
Then N lines follow, 
Address Key Next
11111 100 -1
00001 0 22222
33333 100000 11111
12345 -1 33333
22222 1000 12345
=====================================
where N is the total number of nodes in the list and all the nodes must be sorted order.
5 12345
12345 -1 00001
00001 0 11111
11111 100 22222
22222 1000 33333
33333 100000 -1

//It is guaranteed that all the keys are distinct and there is no cycle in the linked list starting from the head node.
//key sort
*/
//10^5静态数组
#include<cstdio>
#include <algorithm>
using namespace std;
const int maxn=100010;
struct Node{//(1)定义静态链表
    int address,data,next;
    bool flag;//结点是否在链表
}node[maxn];

bool cmp(Node a,Node b){
    if(a.flag==false||b.flag==false){
        return a.flag>b.flag;//如果a,b有一个无效结点，把它放在后面去
    }else{
        return a.data<b.data;//如果有效结点，则要求排序
    }
}

int main(){
    for(int i=0;i<maxn;i++){//（2）初始化
        node[i].flag=false;
    }
    int n,begin;
    int address,data,next;
    scanf("%d%d",&n,&begin);
    for(int i=0;i<n;i++){
        scanf("%d %d %d",&address,&data,&next);
        node[address].address=address;
        node[address].data=data;
        node[address].next=next;
    }
    int count=0,p=begin;
    //（3）枚举链表，对flag进行标记，同时计数有效个数
    while(p!=-1){
        node[p].flag=true;
        count++;
        p=node[p].next;
    }
    if(count==0){//特判，新链表没有结点时输出0 -1
        printf("0 -1");
    }else{
        //（4）筛选有效结点，并按data从小到大排序
        sort(node,node+maxn,cmp);
        //（5）输出结果
        //防止-1被%05d化，提前判断
        printf("%d %05d\n",count,node[0].address);
        for(int i=0;i<count;i++){
            if(i!=count-1){
                printf("%05d %d %05d\n",node[i].address,node[i].data,node[i+1].address);
            }else
                printf("%05d %d -1",node[i].address,node[i].data);
        }
    }
    return 0;
}