代码:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N=1e5+10;
int h,n,m;
int e[N];
int ne[N],fa[N];
int main(){
cin>>h>>n>>m;
while(n--){
int a,b,c;
cin>>a>>b>>c;
e[a]=b;
ne[a]=c;
}
vector<int>q;
for(int i=h;i!=-1;i=ne[i]){
q.push_back(i);
}
for(int i=0;i+m-1<q.size();i+=m){------------------》!!!
reverse(q.begin()+i,q.begin()+i+m);-----------------》!!!
}
for(int i=0;i<q.size();i++){
printf("%05d %d ",q[i],e[q[i]]);
if(i==q.size()-1){
printf("-1");
}
else{
printf("%05d\n",q[i+1]);
}
}
return 0;
}