PAT 1052. Linked List Sorting

这场考试当年还参加了，当时直接用内置的排序了，否则自己写归并排序浪费时间啊，现在来练习一发。估计又有些节点没在链表里面，当时没考虑这个情况，所以一直有些case没过

#include <iostream>
#include <cstdio>
#include <vector>
#include <unordered_map>

using namespace std;

class Node {
public:
    int data;
    int next;
    Node() : data(), next(-){
        cout<<"should not happend"<<endl;
    }
    Node(int d, int n) : data(d), next(n) {}
};

int count(int head, unordered_map<int, Node>& mem) {
    int cur = head;
    int cnt = ;
    while (cur != -) {
        cnt++;
        cur = mem[cur].next;
    }
    return cnt;

}

int step(int head, int k, unordered_map<int, Node>& mem) {
    int cur = head;
    while (cur != -) {
        if (k-- == ) {
            break;

        }
        cur = mem[cur].next;
    }
    return cur;
}

int merge_list(int heada, int headb, unordered_map<int, Node>& mem) {
    int nhead = -;
    int last = -;
    int select = -;
    int ca = heada, cb = headb;
    while (ca != - && cb != -) {
        Node& na = mem[ca];
        Node& nb = mem[cb];

        if (na.data > nb.data) {
            select = cb;
            cb = nb.next;
        } else if (na.data <= nb.data) {
            select = ca;
            ca = na.next;
        }

        if (last == -) {
            nhead = select;
        } else {
            mem[last].next = select;
        }
        last = select;
    }

    int last_part = -;

    if (ca != -) {
        last_part = ca;
    }

    if (cb != -) {
        last_part = cb;
    }

    if (last == -) {
        nhead = last_part;
    } else {
        mem[last].next = last_part;
    }

    return nhead;
}

int sort_list(int head, int n, unordered_map<int, Node>& mem) {

    if (n < ) {
        return -;
    }

    if (n == ) {
        mem[head].next = -;
        return head;
    }

    int a_cnt = n / ;
    int b_cnt = n - a_cnt;

    int ca = head;
    int cb = step(head, a_cnt, mem);

    ca = sort_list(ca, a_cnt, mem);
    cb = sort_list(cb, b_cnt, mem);

    return merge_list(ca, cb, mem);

}

void print_list(int head, unordered_map<int, Node>& mem) {
    int cur = head;
    while (cur != -) {
        Node& cn = mem[cur];
        if (cn.next == -) {
            printf("%05d %d %d\n", cur, cn.data, cn.next);
        } else {
            printf("%05d %d %05d\n", cur, cn.data, cn.next);
        }
        cur = mem[cur].next;
    }
}

int main() {

    int N, head;

    scanf("%d%d", &N, &head);

    unordered_map<int, Node> mem;

    for (int i=; i<N; i++) {
        int addr, data, next;
        scanf("%d%d%d", &addr, &data, &next);
        mem.insert(make_pair(addr, Node(data, next)));
    }

    int n = count(head, mem);

    head = sort_list(head, n, mem);
    if (n > ) {
        printf("%d %05d\n", n, head);
    } else {
        printf("%d %d\n", n, head);
    }
    print_list(head, mem);

    return ;

}