PAT甲级——Graduate Admission

题目描述

It is said that in 2013, there were about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province.  It would help a lot if you could write a program to automate the admission procedure.
Each applicant will have to provide two grades: the national entrance exam grade GE, and the interview grade GI.  The final grade of an applicant is (GE + GI) / 2.  The admission rules are:

• The applicants are ranked according to their final grades, and will be admitted one by one from the top of the rank list.
• If there is a tied final grade, the applicants will be ranked according to their national entrance exam grade GE. If still tied, their ranks must be the same.
• Each applicant may have K choices and the admission will be done according to his/her choices: if according to the rank list, it is one's turn to be admitted; and if the quota of one's most preferred shcool is not exceeded, then one will be admitted to this school, or one's other choices will be considered one by one in order. If one gets rejected by all of preferred schools, then this unfortunate applicant will be rejected.
• If there is a tied rank, and if the corresponding applicants are applying to the same school, then that school must admit all the applicants with the same rank, even if its quota will be exceeded.
  
   

输入描述:

Each input file contains one test case.  Each case starts with a line containing three positive integers: N (<=40,000), the total number of applicants; M (<=100), the total number of graduate schools; and K (<=5), the number of choices an applicant may have.
In the next line, separated by a space, there are M positive integers.  The i-th integer is the quota of the i-th graduate school respectively.
Then N lines follow, each contains 2+K integers separated by a space.  The first 2 integers are the applicant's GE and GI, respectively.  The next K integers represent the preferred schools.  For the sake of simplicity, we assume that the schools are numbered from 0 to M-1, and the applicants are numbered from 0 to N-1.

 

输出描述:

For each test case you should output the admission results for all the graduate schools.  The results of each school must occupy a line, which contains the applicants' numbers that school admits.  The numbers must be in increasing order and be separated by a space.  There must be no extra space at the end of each line.  If no applicant is admitted by a school, you must output an empty line correspondingly.

 

输入例子:

11 6 3
2 1 2 2 2 3
100 100 0 1 2
60 60 2 3 5
100 90 0 3 4
90 100 1 2 0
90 90 5 1 3
80 90 1 0 2
80 80 0 1 2
80 80 0 1 2
80 70 1 3 2
70 80 1 2 3
100 100 0 2 4

 

输出例子:

0 10
3
5 6 7
2 8

1 4

 

代码一（有两个测试点显示格式错误，有待 改正）：

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

struct Student {
	int score1;
	int score2;
	int sum;
	int choice[6];
	int rank=0;
	int admit=-1;
	int id;
}stu[maxn];

bool cmp(Student a,Student b){
	if(a.sum!=b.sum) return a.sum > b.sum;
	else return a.score1 > b.score1;
}

bool cmp_id(Student a, Student b)
{
	return a.id < b.id;
}
int main()
{
	int n, m, k;
	int quota[110];
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 0; i < m; i++)
	{
		scanf("%d", &quota[i]);
	}
	for (int i = 0; i < n; i++)
	{
		scanf("%d%d", &stu[i].score1, &stu[i].score2);
		stu[i].sum = stu[i].score1 + stu[i].score2;
		stu[i].id = i;
		for (int j = 0; j < k; j++)
		{
			scanf("%d", &stu[i].choice[j]);
		}
	}
	sort(stu, stu + n, cmp);
	for (int i = 1; i < n; i++)
	{
		if (stu[i].sum == stu[i - 1].sum && stu[i].score1==stu[i-1].score1)  stu[i].rank = stu[i-1].rank;
		else  stu[i].rank = i;
	}

	int mark[6];
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j< k; j++)
		{
			if (quota[stu[i].choice[j]] != 0)
			{
				quota[stu[i].choice[j]]--;
				mark[stu[i].choice[j]] = i;
				stu[i].admit = stu[i].choice[j];
				
				break;
			}
			else if (quota[stu[i].choice[j]] == 0 && stu[i].rank == stu[mark[stu[i].choice[j]]].rank)
			{
				stu[i].admit = stu[i].choice[j];
				break;
			}

		}
	}
	bool flag = false;
	sort(stu, stu + n, cmp_id);
	int space=0;
	for(int a=0;a<m;a++)
	{ 
		for (int i = 0; i < n; i++)
		{
			if (stu[i].admit == a)
			{
				space++;
			
			}
		}

		for (int i = 0; i < n; i++)
		{
			if (stu[i].admit == a)
			{
				printf("%d", stu[i].id);
				if (space > 1) printf(" ");
				space--;
				flag = true;
			}
			
		}
		if(flag==false) printf("\n");
		else if (a!=m-1) printf("\n");
	}
	return 0;
}

代码二（算法笔记） 

1. 将学生的信息和学校的信息都通过结构体储存，比较清楚；
2. 最后升序输出每个学校录取学生的编号时，直接对学校结构体中的Id[]数组进行排序（里面是录取的学生编号）；

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

struct  Student
{
	int GE, GI, sum;
	int r, stuID;
	int cho[6];
}stu[maxn];

struct School
{
	int quota;
	int stuNum;//当前实际招生人数
	int id[40010];//招收学生的编号
	int lastAdmit;
}sch[110];

bool cmpStu(Student a, Student b)
{
	if (a.sum != b.sum) return a.sum > b.sum;
	else return a.GE > b.GE;
}

bool cmpID(int a, int b)
{
	return stu[a].stuID < stu[b].stuID;
}

int main()
{
	int n, m, k;
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 0; i < m; i++)
	{
		scanf("%d", &sch[i].quota);
		sch[i].stuNum = 0;
		sch[i].lastAdmit = -1;
	}
	for (int i = 0; i < n; i++)
	{
		stu[i].stuID = i;
		scanf("%d%d", &stu[i].GE, &stu[i].GI);
		stu[i].sum = stu[i].GE + stu[i].GI;
		for (int j = 0; j < k; j++)
		{
			scanf("%d", &stu[i].cho[j]);
		}
	}
	sort(stu, stu + n, cmpStu);
	for (int i = 0; i < n; i++)
	{
		if (i > 0 && stu[i].sum == stu[i - 1].sum&&stu[i].GE == stu[i - 1].GE) {
			stu[i].r = stu[i - 1].r;
		}
		else {
			stu[i].r = i;
		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < k; j++)
		{
			int choice = stu[i].cho[j];//考生i的第k个选择学校
			int num = sch[choice].stuNum;//选择学校的当前招生人数
			int last = sch[choice].lastAdmit;
			if (num < sch[choice].quota || (last != -1 && stu[i].r == stu[last].r))
			{
				sch[choice].id[num] = i;
				sch[choice].lastAdmit = i;
				sch[choice].stuNum++;
				break;
			}
		}
	}
	for (int i = 0; i < m; i++)
	{
		if (sch[i].stuNum > 0)
		{
			sort(sch[i].id, sch[i].id + sch[i].stuNum, cmpID);
			for (int j = 0; j < sch[i].stuNum; j++) {
				printf("%d", stu[sch[i].id[j]].stuID);
				if (j < sch[i].stuNum - 1) {
					printf(" ");
				}
			}
		}
		printf("\n");
	}
	return 0;
}