PAT_1025: PAT Ranking

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

registration_number final_rank location_number local_rank

The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

Sample Input:

2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85

Sample Output:

9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4

备注：感觉没啥算法。读输入时就可以进行local sort，读完后进行一次global sort，最后输出rank，搞定！

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

typedef struct person
{
	char id[15];
	int score;
	int loc_num;
	int loc_rank;
	int gol_rank;
}PERSON;

PERSON person_list[30010];

int compare(const void *a, const void *b)
{
	PERSON p1 = *(PERSON *)a;
	PERSON p2 = *(PERSON *)b;

	if(p1.score == p2.score)
		return strcmp(p1.id,p2.id);
	return p2.score - p1.score;
}


void LocalSort(int start, int end)
{
	qsort(person_list+start,end-start+1,sizeof(PERSON),compare);
	int rank = 1;
	for(int i = start;i<=end;i++)
	{
		if(i == start)
		{
			person_list[i].loc_rank = rank;
			rank++;
		}
		else
		{
			if(person_list[i].score == person_list[i-1].score)
			{
				person_list[i].loc_rank = person_list[i-1].loc_rank;
			}
			else
				person_list[i].loc_rank = rank;
			rank++;
		}
	}
}

int main()
{
	int N,K;
	int k;
	scanf("%d",&N);
	
	k = 0;
	int start = 0;
	for(int i=1;i<=N;i++)
	{
		scanf("%d",&K);
		start = k;
		for(int j=1;j<=K;j++)
		{
			PERSON p;
			scanf("%s",p.id);
			scanf("%d",&p.score);
			p.loc_num = i;	
			person_list[k++] = p;
		}
		// local sort
		LocalSort(start, k-1);
	}

	// global sort
	qsort(person_list,k,sizeof(PERSON),compare);
	// output the final rank
	int rank = 1;
	int count_same = 1;
	printf("%d\n",k);
	for(int i = 0; i<k;i++)
	{
		if(i==0)
		{
			printf("%s %d %d %d\n", person_list[i].id,rank,person_list[i].loc_num,person_list[i].loc_rank);
			person_list[i].gol_rank = rank;
			rank++;
		}
		else
		{
			if(person_list[i].score == person_list[i-1].score)
			{
				printf("%s %d %d %d\n", person_list[i].id,person_list[i-1].gol_rank,person_list[i].loc_num,person_list[i].loc_rank);
				person_list[i].gol_rank = person_list[i-1].gol_rank;
			}
			else
			{
				printf("%s %d %d %d\n", person_list[i].id,rank,person_list[i].loc_num,person_list[i].loc_rank);
				person_list[i].gol_rank = rank;
			}
			rank++;
		}
	}
	return 0;
}