Pat grade a real problem 1165

Ideas ： Same as word flipping , Turn over as a whole first , Then flip the length to K The range of

Code ：

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1e5+10;

int h, n, m;
int ne[N], w[N];
int q[N];

int main()
{
    
    
    scanf("%d%d%d",&h, &n, &m);
    
    while (n -- ){
    
        int addr,next,val;
        scanf("%d%d%d",&addr, &val, &next);
        w[addr] = val;
        ne[addr] = next;
    }
    
    int cnt = 0;
    for(int i = h; i != -1; i = ne[i])
        q[cnt++] = i;
        
    reverse(q, q + cnt);
    
    for(int i = cnt - 1; i >= 0; i -= m)
        reverse(q + max(0, i - m + 1), q + i +1);
        
    for(int i = 0; i < cnt; i++){
    
        int addr = q[i], next = q[i + 1];
        printf("%05d %d ", addr, w[addr]);
        if(cnt - 1 == i) puts("-1");
        else printf("%05d\n", next);
    }
    
    return 0;
}