L2-022 重排链表

#include <iostream>
#include <vector>

using namespace std;

const int N = 100010;
int n;
int e[N], ne[N], h;

int main()
{
    cin >> h >> n;
    for(int i = 0; i < n; i ++)
    {
        int add, data, next;
        cin >> add >> data >> next;
        e[add] = data, ne[add] = next;
    }
    vector<int> a, b;
    for(int i = h; ~i; i = ne[i]) a.push_back(i);
    for(int i = 0, j = a.size()- 1; i <= j; i++, j--)
    {
        if(i == j) 
        {
            b.push_back(a[i]);
            continue;
        }
        b.push_back(a[j]);
        b.push_back(a[i]);
    }
    for(int i = 0; i < b.size(); i++)
    {
        if(i == b.size() - 1)
        {
            printf("%05d %d -1\n", b[i], e[b[i]]);
            break;
        }
        printf("%05d %d %05d\n", b[i], e[b[i]], b[i+1]);
    }
}