PAT-A-1080. Graduate Admission (30)
来源:互联网 发布:wifi备份软件 编辑:程序博客网 时间:2024/05/16 02:42
1080. Graduate Admission (30)
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.
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 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.
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 32 1 2 2 2 3100 100 0 1 260 60 2 3 5100 90 0 3 490 100 1 2 090 90 5 1 380 90 1 0 280 80 0 1 280 80 0 1 280 70 1 3 270 80 1 2 3100 100 0 2 4Sample Output:
0 1035 6 72 81 4
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;struct student{ int ge, gi; int rank, id; int sum; int choice[6];}stu[400010];struct school{ int quota; int num = 0; int s[400010]; int lastrank=0;}sch[101];int cmp1(student s1, student s2){ if (s1.sum != s2.sum) return s1.sum > s2.sum; else return s1.ge > s2.ge;}int cmp2(int a, int b){ return a < b;}int main(){ int n, m, k; cin >> n >> m >> k; for (int i = 0; i < m; i++) { cin >> sch[i].quota; } for (int i = 0; i < n; i++) { cin >> stu[i].ge >> stu[i].gi; stu[i].id = i; stu[i].sum = stu[i].ge + stu[i].gi; for (int j = 0; j < k; j++) cin >> stu[i].choice[j]; } sort(stu, stu + n, cmp1); stu[0].rank = 0; for (int i = 1; i < n; i++) { if (stu[i].sum == stu[i - 1].sum&&stu[i].ge == stu[i - 1].ge) stu[i].rank = stu[i - 1].rank; else stu[i].rank = i; } for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { if (sch[stu[i].choice[j]].num < sch[stu[i].choice[j]].quota) { sch[stu[i].choice[j]].num++; sch[stu[i].choice[j]].lastrank = stu[i].rank; sch[stu[i].choice[j]].s[sch[stu[i].choice[j]].num] = stu[i].id; break; } else { if (sch[stu[i].choice[j]].lastrank == stu[i].rank) { sch[stu[i].choice[j]].num++; sch[stu[i].choice[j]].lastrank = stu[i].rank; sch[stu[i].choice[j]].s[sch[stu[i].choice[j]].num] = stu[i].id; break; } } } } for (int i = 0; i < m; i++) { int flag = 0; if (sch[i].num != 0) { sort(sch[i].s + 1, sch[i].s + 1 + sch[i].num, cmp2); for (int j = 1; j <= sch[i].num; j++) { if (flag == 0) { cout << sch[i].s[j]; flag = 1; } else cout << " " << sch[i].s[j]; } } cout << endl; } system("pause"); return 0; }
- PAT A 1080. Graduate Admission (30)
- PAT(A) - 1080. Graduate Admission (30)
- PAT-A-1080. Graduate Admission (30)
- PAT 1080. Graduate Admission (30)
- PAT 1080. Graduate Admission (30)
- PAT 1080. Graduate Admission (30)
- 【PAT】1080. Graduate Admission (30)
- 1080. Graduate Admission (30) PAT
- pat-1080. Graduate Admission (30)
- 【PAT】1080. Graduate Admission
- PAT (Advanced) 1080. Graduate Admission (30)
- PAT Advanced Level 1080. Graduate Admission (30)
- 1080. Graduate Admission (30) PAT 甲级
- PAT甲级练习1080. Graduate Admission (30)
- 【PAT】【Advanced Level】1080. Graduate Admission (30)
- PAT 1080. Graduate Admission (30) 已通过
- PAT 甲级 1080. Graduate Admission (30)
- PAT 1015Graduate Admission (30)
- 【转载】Windows下彻底卸载删除SQL Serever 2012
- 霍夫变换直线检测的matlab实现
- Linux磁盘和文件系统管理
- 消息队列和管道的区别(转载)
- 自动化运维——一键安装MySQL
- PAT-A-1080. Graduate Admission (30)
- Python 列表推导式应用
- 程序员思考
- 整理一下当年的学习笔记之:多个请求使用同一个Servlet
- 神经网络常用激活函数对比:sigmoid VS sofmax(附python源码)
- FatMouse' Trade
- 机器学习数学原理(1)——极大似然估计法
- php 获取指定目录下面的某个随机文件名
- C# Winform 窗体美化(一、IrisSkin 换肤库)