|链表 倒块输出|19冬第二题1165 Block Reversing (25分) 跟1133类似的题目

#include <iostream>
#include <algorithm>
using namespace std;
int const maxn = 100010;

struct Node {
	int address,data,next;
	int order;
}node[maxn];

bool cmp(Node a,Node b) {
	return a.order < b.order;
}

int main() {
	for (int i = 0; i < maxn; i++) {
		node[i].order = 2 * maxn;
	}

	int s, n, k;
	cin >> s >> n >> k;

	for (int i = 0; i < n; i++) {
		int address,data,next;

		cin >> address;
		node[address].address = address;
		cin >> node[address].data>>node[address].next;
	}

	int p;
	int cntValid = 0;
	for (p= s; p!= -1; p = node[p].next) {
		node[p].order = cntValid++;
	}

	sort(node, node + maxn, cmp);

	//cout << "-------------------" << endl;
	//n=8,k=4
	if (n % k == 0) {//能被整除 //每块都由k个链结点组成
		//第i块
		for (int i = n/k-1; i>=0; i--) {//i=0,i<8/4=2//0//1
			//第i块的第j个链结点
			//i=0;j=0 j<4//j=0123
			//i=1;j=4 j<8//j=4567
			for (int j = i* k; j < (i + 1) * k;j++) {
				printf("%05d %d ", node[j].address, node[j].data);
				if (node[j].next == -1)
					printf("%05d\n", node[(i - 1) * k].address);
				else if (j != k-1) {
					printf("%05d\n", node[j].next);
				}
				else if(j==k-1) cout << "-1";
			}
		}
	}
	else {
		//第i块
		int i;
		for (i = n / k; i >= 0; i--) {//i=0,i<8/4=2//0//1
			//第i块的第j个链结点
			//i=0;j=0 j<4//j=0123
			//i=1;j=4 j<8//j=4567
			//8/3=2//2*3=6
			//最后一块
			if (i == n / k) {
				for (int i = n / k * k; i < n; i++) {
					printf("%05d %d ", node[i].address, node[i].data);
					if (node[i].next == -1)
						printf("%05d\n", node[(n/k-1)*k].address);
					else
						printf("%05d\n", node[i].next);
				}
			}
			else {
				for (int j = i * k; j < (i + 1) * k; j++) {
					if (j != k - 1) {
						printf("%05d %d %05d\n", node[j].address, node[j].data, node[j].next);
					}else printf("%05d %d -1\n", node[j].address, node[j].data);
				}
			}
		}
	
	
	}


	/*
	cout << "-------------------------------" << endl;
	for (int i = 0; i < n; i++) {
		printf("%05d %d %05d\n", node[i].address, node[i].data, node[i + 1].address);
	}*/
	return 0;
}
/*
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

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

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

*/