PATA1174_链表（难度：⭐️）

模版题没难度，上代码。

#include <bits/stdc++.h>
using namespace std;
struct list {
    int val, next;
}List[100000];
vector<int> v;
int main() {
    int fAd, n, k, ad, val, next;
    scanf ("%d %d %d", &fAd, &n, &k);
    for (int i = 0; i < n; i++) {
        scanf ("%d %d %d", &ad, &val, &next);
        List[ad].val = val;
        List[ad].next = next;
    }
    while (fAd != -1) {
        v.push_back(fAd);
        fAd = List[fAd].next;
    }
    for (int i = 0; i < v.size() / k; i++) {
        reverse(v.begin() + i * k, v.begin() + (i + 1) * k);
    }
    for (int i = 0; i < v.size(); i++) {
        if (i != v.size() - 1) {
            printf ("%05d %d %05d\n", v[i], List[v[i]], v[i + 1]);
        }
        else 
            printf ("%05d %d -1", v[i], List[v[i]]);
    }
}