2021-02-11

Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.
Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (≤10​5​​) which is the total number of nodes, and a positive K (≤N) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then N lines follow, each describes a node in the format:

Address Data Next

where Address is the position of the node, Data is an integer, and Next is the position of the next node.
Output Specification:

For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.
Sample Input:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct node{
    int head,data;
    //不需要保存下一个，因为反转的时候下一个会变还不如不要
};
int main(){
    int first,n,k,data[100005],next[100005];
    cin>>first>>n>>k;
    for(int i=0;i<n;i++){
        int num;
        cin>>num;
        cin>>data[num]>>next[num];
    }
    vector<node>t;
    while(first!=-1){//排除一些无用节点
        t.push_back(node{first,data[first]});
        first=next[first];
    }
    for(int i=0;i<t.size()-(t.size()%k);i+=k)//不满k不反转
        reverse(t.begin()+i,t.begin()+i+k);
    //先输出当前的节点head和data   
    printf("%05d %d",t[0].head,t[0].data);
    
    for(int i=1;i<t.size();i++)
        printf(" %05d\n%05d %d",t[i].head,t[i].head,t[i].data);
        //再输出下一个节点head，因为当前节点的下一个是下一个节点的head，所以还不如直接放在一起输出。
    printf(" -1");
    return 0;
}