PAT A1080. Graduate Admission (30)
来源:互联网 发布:最为突出的大数据环境 编辑:程序博客网 时间:2024/05/16 10:32
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 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
代码:
/********************************** 日期:2017-2-27* 作者:qiminghao* 题号: PAT A1080. Graduate Admission (30)* 来源:https://www.patest.cn/contests/pat-a-practise/1080* 结果:AC* 来源:PAT甲级试题* 总结:**********************************/#include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<algorithm>#include<vector>#include<set>using namespace std;struct node{ int cho[6]; int id,rank; int ge,gi,sum;}stu[40001];struct node1{ int quota; int stuNum; int id[40001]; int lastAdmin;}sch[100];bool cmp(struct node a,struct node b){ if(a.sum!=b.sum) return a.sum>b.sum; else return a.ge>b.ge;}int main(){ int n,m,k,i,j; scanf("%d%d%d",&n,&m,&k); for(i=0;i<m;i++) { scanf("%d",&sch[i].quota); sch[i].stuNum=0; sch[i].lastAdmin=-1; } for(i=0;i<n;i++) { scanf("%d%d",&stu[i].ge,&stu[i].gi); stu[i].sum=stu[i].ge+stu[i].gi; stu[i].id=i; stu[i].rank=1; for(j=0;j<k;j++) scanf("%d",&stu[i].cho[j]); } sort(stu,stu+n,cmp); for(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+1; } for(i=0;i<n;i++) { for(j=0;j<k;j++) { int choose=stu[i].cho[j]; if(sch[choose].quota>0) { sch[choose].quota--; sch[choose].stuNum++; sch[choose].lastAdmin=i; sch[choose].id[sch[choose].stuNum-1]=stu[i].id; break; }else if(stu[sch[choose].lastAdmin].rank==stu[i].rank) { sch[choose].stuNum++; sch[choose].lastAdmin=i; sch[choose].id[sch[choose].stuNum-1]=stu[i].id; break; } } } for(i=0;i<m;i++) { if(sch[i].stuNum!=0) { sort(sch[i].id,sch[i].id+sch[i].stuNum); for(j=0;j<sch[i].stuNum;j++) { if(j!=0) printf(" "); printf("%d",sch[i].id[j]); } } printf("\n"); } return 0;}
- pat-A1080. Graduate Admission (30)
- PAT A1080. Graduate Admission (30)
- PAT A1080 graduate admission (30)
- PAT A1080. Graduate Admission (30)
- PAT-A1080. Graduate Admission (30)(排序)
- A1080. Graduate Admission (30)
- A1080. Graduate Admission (30)
- PAT A1080 Gradate Admission
- 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 1015Graduate Admission (30)
- pat-1080. Graduate Admission (30)
- PAT 1080-Graduate Admission (30)
- PAT (Advanced) 1080. Graduate Admission (30)
- PAT Advanced Level 1080. Graduate Admission (30)
- 宝宝来了
- 先解决思想:为何要写单元测试
- Polynomial Regression
- 算法课第1周第2题——10. Regular Expression Matching
- 北京大学违纪派收取挂号信件,为何心神总是不安?
- PAT A1080. Graduate Admission (30)
- CPU调度算法
- 算法课第1周第3题——38. Count and Say
- MATLAB读视频
- Struts2访问Servlet API
- 进程和线程的区别
- Leetcode 71. Simplify Path
- 18. 4Sum
- classification problems——logistic regression