PAT甲级1080 Graduate Admission (30 分)

1080 Graduate Admission (30 分)

It is said that in 2011, there are 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 G​E​​, and the interview grade G​I​​. The final grade of an applicant is (G​E​​+G​I​​)/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 G​E​​. 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.

Input Specification:

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 G​E​​ and G​I​​, 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.

Output Specification:

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.

Sample Input:

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

Sample Output:

0 10

3

5 6 7

2 8

 

1 4

      题目大意：

         给出n个学生的志愿单以及成绩，还有m所学校和每个人的k个意愿学校。

         下一行是每个学校的招生名额。招生规则是按照总成绩排名，如果总成绩相同者则按照笔试成绩排名，如果笔试成绩也相同则视为相同排名。注意如果有选填该校的学生且该生的排名与录取的最后一名的排名一样，那么要破格录取。输出每所学校的招生名单，按照学生id字典序升序。

 

思路：

         盯准要输出的信息，那么需要构造一个数组ans，用于存储每个学校的录取学校。再由输出信息所需要的元素进行算法构造。

         由于需要存储笔试与面试成绩，还有总成绩与后来的排名，以及每个学生的志愿学校清单want那么就构造一个结构体node。即便不需要输出排名，但由于在排序后需要去确认是否要破格录取，所以还是需要存储具体排名的。

         应该按照排名后的学生列表一个个去分配学校，并且由于有破格录取的情况存在，必须又另开设一个数组last存储每个学校最后一名的学生排名。

         最后是解决算法中边角料信息，也就是需要一个sch存储每个学校的名额。

 

参考代码：

 

#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
	int ge, gi, id, r;
	double final;
	vector<int>want;
};
vector<node> list;
vector<int> sch, last, now;
vector<vector<int> > ans;
int n, m, k;
bool cmp(node a, node b){
	if(a.final != b.final)	return a.final > b.final;
	else if(a.ge != b.ge)	return a.ge > b.ge;
	else	return a.id < b.id;
}
bool cmp2(int  a, int b){return a < b;}
int main(){
	scanf("%d%d%d", &n, &m, &k);
	list.resize(n), sch.resize(m), last.resize(m), now.resize(m), ans.resize(m);
	for(int i = 0; i < m; ++i)	scanf("%d", &sch[i]);
	for(int i = 0; i < n; ++i){
		list[i].want.resize(k);
		scanf("%d%d", &list[i].ge, &list[i].gi);
		list[i].final = (list[i].ge + list[i].gi) / 2; 
		list[i].id = i;
		for(int j = 0; j < k; ++j)	scanf("%d", &list[i].want[j]);
	}
	sort(list.begin(), list.end(), cmp);
	for(int i = 0; i < n; ++i){
		list[i].r = i + 1;
		if(i != 0 && list[i].final == list[i - 1].final && list[i].ge == list[i - 1].ge)
			list[i].r = list[i - 1].r; 
	}
	for(int i = 0; i < n; ++i)
		for(int j = 0; j < k; ++j){
			int want = list[i].want[j];
			if(now[want] < sch[want]){
				now[want]++;
				last[want] = list[i].r;
				ans[want].push_back(list[i].id);
				break;
			}else if(last[want] == list[i].r){
				ans[want].push_back(list[i].id);
				break;
			}
		}
	for(int i = 0; i < m; ++i){
		if(ans[i].size() == 0){
			printf("\n");
			continue;
		}
		sort(ans[i].begin(), ans[i].end(), cmp2);
		for(int j = 0; j < ans[i].size() -1; ++j)	printf("%d ", ans[i][j]);
		printf("%d\n", ans[i][ans[i].size() - 1]);
	}
	return 0;
}