[DS][Sort][PAT][PAT Judge]

1075. PAT Judge (25)

The ranklist of PAT is generated from the status list, which shows the scores of the submittions. This time you are supposed to generate the ranklist for PAT.

Input Specification:

Each input file contains one test case. For each case, the first line contains 3 positive integers, N (<=10⁴), the total number of users, K (<=5), the total number of problems, and M (<=10⁵), the total number of submittions. It is then assumed that the user id's are 5-digit numbers from 00001 to N, and the problem id's are from 1 to K. The next line contains K positive integers p[i] (i=1, ..., K), where p[i] corresponds to the full mark of the i-th problem. Then M lines follow, each gives the information of a submittion in the following format:

user_id problem_id partial_score_obtained

where partial_score_obtained is either -1 if the submittion cannot even pass the compiler, or is an integer in the range [0, p[problem_id]]. All the numbers in a line are separated by a space.

Output Specification:

For each test case, you are supposed to output the ranklist in the following format:

rank user_id total_score s[1] ... s[K]

where rank is calculated according to the total_score, and all the users with the same total_score obtain the same rank; and s[i] is the partial score obtained for the i-th problem. If a user has never submitted a solution for a problem, then "-" must be printed at the corresponding position. If a user has submitted several solutions to solve one problem, then the highest score will be counted.

The ranklist must be printed in non-decreasing order of the ranks. For those who have the same rank, users must be sorted in nonincreasing order according to the number of perfectly solved problems. And if there is still a tie, then they must be printed in increasing order of their id's. For those who has never submitted any solution that can pass the compiler, or has never submitted any solution, they must NOT be shown on the ranklist. It is guaranteed that at least one user can be shown on the ranklist.

Sample Input:

7 4 20
20 25 25 30
00002 2 12
00007 4 17
00005 1 19
00007 2 25
00005 1 20
00002 2 2
00005 1 15
00001 1 18
00004 3 25
00002 2 25
00005 3 22
00006 4 -1
00001 2 18
00002 1 20
00004 1 15
00002 4 18
00001 3 4
00001 4 2
00005 2 -1
00004 2 0

Sample Output:

1 00002 63 20 25 - 18
2 00005 42 20 0 22 -
2 00007 42 - 25 - 17
2 00001 42 18 18 4 2
5 00004 40 15 0 25 -

从下午两点做到晚上八点，提交了还是会有错。对基数排序还不是很熟，有些原理也没搞清楚。

这题是一道多关键字排序问题。刚复习了基数排序，基数排序可以用来解决多关键字排序，所以一直在用基数排序解决这个问题。

照着严蔚敏的《数据结构》实现了基数排序如下：

可以用来排序正整数

#include <iostream>
#include <cmath>
using namespace std;

#define MAX_NUM_OF_KEY	8
#define RADIX			10
typedef int KeysType;
struct SLCell {
	//KeysType keys[MAX_NUM_OF_KEY];
	int keys;
	int next;
};
struct SLList {
	SLCell *r;
	int keynum;
	int recnum;
};
typedef int ArrType[RADIX];

void Distribute(SLCell r[], int i, ArrType &f, ArrType &e)
{
	int j;
	for (j = 0; j < RADIX; ++j) {
		f[j] = 0;
	}
	for (int p = r[0].next; p; p = r[p].next) {
		j = r[p].keys / (int)pow(10, i) % 10;   // ord(r[p].keys[i]);
		if (!f[j]) f[j] = p;
		else r[e[j]].next = p;
		e[j] = p;
	}
}

void Collect(SLCell r[], int i, ArrType f, ArrType e)
{
	int j, t;
	for (j = 0; !f[j]; ++j);
	r[0].next = f[j];
	t = e[j];
	while (j < RADIX - 1) {
		for (++j; j < RADIX - 1 && !f[j]; ++j);
		if (f[j]) {
			r[t].next = f[j];
			t = e[j];
		}
	}
	r[t].next = 0;
}
void Radix_Sort(SLList &L)
{
	ArrType f, e;
	for (int i = 0; i < L.recnum; ++i) {
		L.r[i].next = i + 1;
	}
	L.r[L.recnum].next = 0;
	for (int i = 0; i < L.keynum; ++i) {
		Distribute(L.r, i, f, e);
		Collect(L.r, i, f, e);
	}
}
int main()
{
	//Radix Sort
	int kNum, max = 0;
	SLList L;

	cin >> L.recnum;
	L.r = (SLCell *)malloc(L.recnum * sizeof(SLCell));
	for (int i = 0; i != L.recnum; ++i) {
		cin >> L.r[i + 1].keys;
		if (L.r[i + 1].keys > max) max = L.r[i + 1].keys;
	}
	for (kNum = 1;; ++kNum) {
		if (0 == max / 10) break;
		max /= 10;
	}
	L.keynum = kNum;

	Radix_Sort(L);

	//right output method
	int p;
	for (p = L.r[0].next; L.r[p].next; p = L.r[p].next) {
		cout << L.r[p].keys << " ";
	}
	cout << L.r[p].keys << endl;

	//wrong output method
	//for (int i = 0; i != L.recnum; ++i) {
	//	cout << L.r[i + 1].keys << " ";
	//}
	//cout << endl;
}
本题对基数排序改写如下：（仍然存在问题，能过PAT上的几个测试用例）
#include <iostream>
#include <cmath>
using namespace std;


#define MAX_NUM_OF_KEY	8
#define RADIX			10
typedef int KeysType;
struct SLCell {
	//KeysType keys[MAX_NUM_OF_KEY];
	int *keys[4];
	int unpass[6];//process -1
	int next;
};
struct SLList {
	SLCell *r;
	int keynum;
	int recnum;
	int Kpass[2];
};
typedef int ArrType[RADIX];


void Distribute(SLCell r[], int i, ArrType &f, ArrType &e, int u)
{
	int j;
	for (j = 0; j < RADIX; ++j) {
		f[j] = 0;
	}
	for (int p = r[0].next; p; p = r[p].next) {
		//j = ord(r[p].keys[i]);
		j = r[p].keys[i][0] / (int)pow(10, u) % 10;
		if (!f[j]) f[j] = p;
		else r[e[j]].next = p;
		e[j] = p;
	}
}
void Collect(SLCell r[], int i, ArrType f, ArrType e)
{
	int j, t;
	for (j = 0; !f[j]; ++j);
	r[0].next = f[j];
	t = e[j];
	while (j < RADIX - 1) {
		for (++j; j < RADIX - 1 && !f[j]; ++j);
		if (f[j]) {
			r[t].next = f[j];
			t = e[j];
		}
	}
	r[t].next = 0;
}
void Distribute2(SLCell r[], int i, ArrType &f, ArrType &e, int u)
{
	int j;
	for (j = 0; j < RADIX; ++j) {
		f[j] = 0;
	}
	int p2;
	for (int p = r[0].next; p; p = p2) {
		//j = ord(r[p].keys[i]);
		j = r[p].keys[i][0] / (int)pow(10, u) % 10;
		p2 = r[p].next;
		if (!f[j]) {
			e[j] = p;
		} else {
			r[p].next = f[j];
		}
		f[j] = p;
	}
}
void Collect2(SLCell r[], int i, ArrType f, ArrType e)
{
	int j, t;
	for (j = RADIX - 1; !f[j]; --j);
	r[0].next = f[j];
	t = e[j];
	while (j > 0) {
		for (--j; j > 0 && !f[j]; --j);
		if (f[j]) {
			r[t].next = f[j];
			t = e[j];
		}
	}
	r[t].next = 0;
}
void Radix_Sort2(SLList &L)
{
	ArrType f, e;
	for (int i = L.recnum; i > 0; --i) {
		L.r[i].next = i - 1;
	}
	L.r[0].next = L.recnum;
	for (int i = L.keynum - 3; i >= 0; --i) {
		for (int j = 0; j < L.Kpass[i]; ++j) {
			Distribute2(L.r, i, f, e, j);
			Collect2(L.r, i, f, e);
		}
	}
}
void Radix_Sort(SLList &L)
{
	ArrType f, e;
	for (int i = 0; i < L.recnum; ++i) {
		L.r[i].next = i + 1;
	}
	L.r[L.recnum].next = 0;
	for (int i = L.keynum - 3; i >= 0; --i) {
		for (int j = 0; j < L.Kpass[i]; ++j) {
			Distribute(L.r, i, f, e, j);
			Collect2(L.r, i, f, e);
		}
	}
}


int main()
{
	int N, K, M, id, proNum, proScore, kNum, max = 0;
	int *p;	//full scores
	SLList L;


	cin >> N >> K >> M;


	p = (int *)malloc((K + 1) * sizeof(int));
	for (int i = 0; i != K; ++i) {
		cin >> p[i + 1];	//p[1..K] is scores
	}


	//allocate memory
	L.recnum = N;
	L.r = (SLCell *)malloc((N + 1) * sizeof(SLCell));
	for (int i = 0; i != N + 1; ++i) {
		L.r[i].keys[0] = (int *)malloc(sizeof(int));
		L.r[i].keys[1] = (int *)malloc(sizeof(int));
		L.r[i].keys[2] = (int *)malloc((K + 1) * sizeof(int));
	}
	//initialize
	for (int i = 0; i != N + 1; ++i) {
		L.r[i].keys[0][0] = 0;
		L.r[i].keys[1][0] = 0;
		for (int j = 0; j != K + 1; ++j) {
			L.r[i].keys[2][j] = 0;
		}
		for (int j = 0; j != 6; ++j) {
			L.r[i].unpass[j] = -1;
		}
	}


	int Kpass[2] = { 0, 0 };
	//input
	for (int i = 0; i != M; ++i) {
		cin >> id >> proNum >> proScore;


		if (proScore == p[proNum]) {
			++(L.r[id].keys[1][0]);


			if (L.r[id].keys[1][0] > Kpass[1]) {
				Kpass[1] = L.r[id].keys[1][0];
			}
		}
		if (proScore > L.r[id].keys[2][proNum]) {
			L.r[id].keys[2][proNum] = proScore;
		}
		L.r[id].unpass[proNum] = 0;
	}
	for (int i = 1; i != N + 1; ++i) {
		int sum = 0;
		for (int j = 1; j != K + 1; ++j) {
			sum += L.r[i].keys[2][j];
		}
		L.r[i].keys[0][0] = sum;


		if (sum > Kpass[0]) {
			Kpass[0] = sum;
		}
	}
	L.keynum = 4;
	//get Kpass
	for (int i = 0; i < 2; ++i) {
		int k;
		for (k = 1; ; ++k) {
			Kpass[i] /= 10;
			if (0 == Kpass[i]) break;
		}
		L.Kpass[i] = k;
	}


	Radix_Sort(L);


	//output
	int pos;
	int rank = 0, rank2 = 0;
	int preScore = 0;
	for (pos = L.r[0].next; pos; pos = L.r[pos].next) {
		if (L.r[pos].keys[0][0] != 0) {
			++rank2;
			if (L.r[pos].keys[0][0] != preScore) {
				rank = rank2;
				preScore = L.r[pos].keys[0][0];
			}
			cout << rank << " ";
			printf("%05d ", pos);
			cout << L.r[pos].keys[0][0] << " ";
			int i;
			for (i = 1; i != K; ++i) {
				if (L.r[pos].unpass[i] != -1) {
					cout << L.r[pos].keys[2][i] << " ";
				} else {
					cout << "-" << " ";
				}
			}
			if (L.r[pos].unpass[i] != -1) {
				cout << L.r[pos].keys[2][i] << endl;
			} else {
				cout << "-" << endl;
			}
		}
	}


	//right output method
	//int p;
	//for (p = L.r[0].next; L.r[p].next; p = L.r[p].next) {
	//	cout << L.r[p].keys << " ";
	//}
	//cout << L.r[p].keys << endl;


}