1165 Block Reversing分数 25

Given a singly linked list L. Let us consider every K nodes as a block (if there are less than K nodes at the end of the list, the rest of the nodes are still considered as a block). Your job is to reverse all the blocks in L. For example, given L as 1→2→3→4→5→6→7→8 and K as 3, your output must be 7→8→4→5→6→1→2→3.

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 (≤105) which is the total number of nodes, and a positive K (≤N) which is the size of a block. 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 8 3
71120 7 88666
00000 4 99999
00100 1 12309
68237 6 71120
33218 3 00000
99999 5 68237
88666 8 -1
12309 2 33218

Sample Output:

71120 7 88666
88666 8 00000
00000 4 99999
99999 5 68237
68237 6 00100
00100 1 12309
12309 2 33218
33218 3 -1

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N = 100010;
int ne[N],e[N];
int n,k;
int main(){
    int h;
    scanf("%d %d %d",&h,&n,&k);
    for(int i = 0;i<n;i++){
        int address,data,next;scanf("%d %d %d",&address,&data,&next);
        ne[address] = next;
        e[address] = data;
    }
    vector<int> v;
    for(int i = h;~i;i=ne[i]){
        v.push_back(i);
    }
    reverse(v.begin(),v.end());
    int s = v.size();
    for(int i = 0;i<s;){
        if(!i&&s%k!=0){
             int len = s%k;
             reverse(v.begin()+i,v.begin()+i+min(len,s));
             i+=len;
        }else{
             reverse(v.begin()+i,v.begin()+i+min(k,s));
             i+=k;
        }
     }
    for(int i = 0;i<s;i++){
        printf("%05d %d",v[i],e[v[i]]);
        if(i==s-1) printf(" -1\n");
        else printf(" %05d\n",v[i+1]);
    }
}