PAT（甲级）2019年冬季考试7-2 Block Reversing (25 分)

7-2 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 (≤10​^5​​ ) 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

就先把输入的节点reverse一次然后从后往前每K个节点reverse一次，最后不够K个节点也要reverse一次

#include<bits/stdc++.h>
using namespace std;
struct Node {
	int address, data, next;
}node [100005];
int S, N, K;
int main() {
	scanf("%d %d %d", &S, &N, &K);
	for (int i = 0; i < N; i++) {
		int id;
		scanf("%d", &id);
		scanf("%d %d", &node[id].data, &node[id].next);
		node[id].address = id;
	}
	vector<Node> ans;
	while (S != -1) {
		ans.push_back(node[S]);
		S = node[S].next;
	}
	N = ans.size(); 
	reverse(ans.begin(), ans.end());
	for (int i = 0; i < N / K; i++) {
		reverse(ans.end() - (i + 1) * K, ans.end() - i * K);
	}
	reverse(ans.begin(), ans.end() - (N / K) * K);
	for (int i = 0; i < ans.size(); i++) {
		if (i != ans.size() - 1) {
			printf("%05d %d %05d\n", ans[i].address, ans[i].data, ans[i + 1].address);
		} else printf("%05d %d -1", ans[i].address, ans[i].data);
	}
	return 0;
}