1133 Splitting A Linked List（25 分）

Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those greater than K. The order of the elements inside each class must not be changed. For example, given the list being 18→7→-4→0→5→-6→10→11→-2 and K being 10, you must output -4→-6→-2→7→0→5→10→18→11.

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 (≤10​3​​). 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 in [−10​5​​,10​5​​], and Next is the position of the next node. It is guaranteed that the list is not empty.

Output Specification:

For each case, output in order (from beginning to the end of the list) the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:

00100 9 10
23333 10 27777
00000 0 99999
00100 18 12309
68237 -6 23333
33218 -4 00000
48652 -2 -1
99999 5 68237
27777 11 48652
12309 7 33218

Sample Output:

33218 -4 68237
68237 -6 48652
48652 -2 12309
12309 7 00000
00000 0 99999
99999 5 23333
23333 10 00100
00100 18 27777
27777 11 -1

 给的结点未必都有效，输入vector数组的时候应该用-1来判断结束

#include<cstdio>
#include<cstring>
#include<fstream>
#include<vector>
using namespace std;
const int maxn=100010;

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

int main(){
	int n, k;
	int address;
//	freopen("d://in.txt","r",stdin);
	scanf("%d%d%d", &address, &n, &k);
	
	int temp, data, next;
	for(int i=0; i<n; i++){
		scanf("%d%d%d", &temp, &data, &next);
		node[temp].address=temp;
		node[temp].data=data;
		node[temp].next=next;
	}
	
	vector<Node> v, ans;
	while(address!=-1){
		v.push_back(node[address]);
		address=node[address].next;
	}
	for(int i=0; i<v.size(); i++){
		if(v[i].data<0){
			ans.push_back(v[i]);
		}
	}
	for(int i=0; i<v.size(); i++){
		if(v[i].data>=0 && v[i].data<=k){
			ans.push_back(v[i]);
		}
	}
	for(int i=0; i<v.size(); i++){
		if(v[i].data>k){
			ans.push_back(v[i]);
		}
	}
	int len=ans.size();
	for(int i=0; i<len; i++){
		if(i!=len-1){
			printf("%05d %d %05d\n", ans[i].address, ans[i].data, ans[i+1].address);
		} else{
			printf("%05d %d -1\n", ans[i].address, ans[i].data);
		}
	}
	return 0;
}