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(\le 10{}^5)$ which is the total number of nodes, and a positive $K(\le 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 <bits/stdc++.h>
using namespace std; 
const int N = 1e5+5;
struct node{
	int add, val, next; 
	int tag1, tag2; 
}E[N]; 

bool cmp(node a, node b){
	if(a.tag1 != b.tag1) return a.tag1 > b.tag1;
	return a.tag2 > b.tag2; 
} 

int main(){
	int st, n, k, add;
	scanf("%d%d%d",&st, &n, &k);
	for(int i = 0; i < N; i++){
		E[i].tag1 = -1;
		E[i].tag2 = -1; 
	} 
	for(int i = 0; i < n; i++){
		scanf("%d", &add);
		E[add].add = add; 
		scanf("%d %d", &E[add].val, &E[add].next); 
	}  
	int p = st, g = 1, cnt = 0, num = 0;
	while(p != -1){
		E[p].tag1 = g; 
		E[p].tag2 = k - cnt; 
		cnt++; 
		num++; 
		if(cnt % k == 0) g++, cnt = 0;
		p = E[p].next; 
	} 
	sort(E, E + N, cmp); 
	for(int i = 0; i < num; i++){
		if(i != num - 1) printf("%05d %d %05d\n", E[i].add, E[i].val, E[i+1].add);
		else printf("%05d %d -1\n", E[i].add, E[i].val); 
	} 
	return 0;
}