1052. Linked List Sorting (25)

    特别注意，N虽然是正数，但并不一定都合法，所以有效节点个数可能为0，感觉这个在玩文字游戏，没意思。

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

struct Node{
int address;
int key;
int next;

Node(){}
Node(int a, int k, int n) : address(a), key(k), next(n){}
bool operator < (const Node& rhs) const{
return key < rhs.key;
}
};

Node inputs[100005];

int main(){
int n, head;
scanf("%d%d", &n, &head);

for(int i = 0; i < n; ++i){
int address, key, next;
scanf("%d%d%d", &address, &key, &next);
inputs[address] = Node(address, key, next);
}

vector<Node> nodes;
for(int i = head; i >= 0; i = inputs[i].next){
nodes.push_back(inputs[i]);
}

sort(begin(nodes), end(nodes));
for(size_t i = 0; i < nodes.size(); ++i){
if(i+1 == nodes.size()) nodes[i].next = -1;
else nodes[i].next = nodes[i+1].address;
}

if(nodes.size()) printf("%d %05d\n", (int)nodes.size(), nodes[0].address);
else printf("0 -1\n");

for(size_t i = 0; i < nodes.size(); ++i){
if(i+1 == nodes.size()) printf("%05d %d -1\n", nodes[i].address, nodes[i].key);
else printf("%05d %d %05d\n", nodes[i].address, nodes[i].key, nodes[i].next);
}

return 0;
}