由于本人比较懒所以就不写解释说明和注释啦,不过代码的可读性和简洁性还是有保证哒,和之后有时间的话再写解释说明吧…
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct node {
int address;
int data;
int next;
} list[100010];
vector<node> ans;
int main() {
int head, n, k;
scanf("%d%d%d", &head, &n, &k);
for (int i = 0; i < n; i++) {
int address;
scanf("%d", &address);
list[address].address = address;
scanf("%d%d", &list[address].data, &list[address].next);
}
int p = head;
while (p != -1) {
ans.push_back(list[p]);
p = list[p].next;
}
int r_num = ans.size() / k;
for (int i = 0; i < r_num; i++) {
reverse(ans.begin() + i * k, ans.begin() + (i + 1) * k);
}
for (int i = 0 ; i < ans.size(); i++) {
if (i == ans.size() - 1) printf("%05d %d -1\n", ans[i].address, ans[i].data);
else printf("%05d %d %05d\n", ans[i].address, ans[i].data, ans[i+1].address);
}
return 0;
}