PAT 1080. Graduate Admission (30) 已通过
来源:互联网 发布:mac上装ios模拟器 编辑:程序博客网 时间:2024/05/20 02:22
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<stdio.h>#include<queue>#include<algorithm>#include<string.h>#include<string>#include<vector>using namespace std;int quota[105]; //不懂之前为啥定义成15 ??struct{ int p=0; int last=-2; int num[40005];}node[105];struct ZZ{ int sum; int ge; int id; int rankk=-1; int want[5]; bool operator < (const ZZ &A) const{ if(sum!=A.sum) return sum>A.sum; return ge>A.ge; }}student[40005];int main(){ int n,m,k; cin>>n>>m>>k; for(int i=0;i<m;i++) scanf("%d","a[i]); for(int i=0;i<n;i++) { int x,y,z; student[i].id=i; scanf("%d %d",&x,&y); student[i].sum=x+y; student[i].ge=x; for(int j=0;j<k;j++) {scanf("%d",&z); student[i].want[j]=z; } } sort(student,student+n); student[0].rankk=0; for(int i=1;i<n;i++) { if(student[i].sum==student[i-1].sum&&student[i-1].ge==student[i].ge) student[i].rankk=student[i-1].rankk; else student[i].rankk=i; } for(int i=0;i<n;i++) { int wanna; for(int j=0;j<k;j++) { wanna=student[i].want[j]; if(node[wanna].p<quota[wanna]||node[wanna].last==student[i].rankk) { node[wanna].num[node[wanna].p++]=student[i].id; node[wanna].last=student[i].rankk; break; } } } for(int i=0;i<m;i++) { if(node[i].p==0) cout<<endl; else { sort(node[i].num,node[i].num+node[i].p); printf("%d",node[i].num[0]); for(int j=1;j<node[i].p;j++) printf(" %d",node[i].num[j]); cout<<endl; } } return 0;}
- PAT 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)
- PAT A 1080. Graduate Admission (30)
- PAT(A) - 1080. Graduate Admission (30)
- 1080. Graduate Admission (30) PAT 甲级
- PAT甲级练习1080. Graduate Admission (30)
- PAT-A-1080. Graduate Admission (30)
- 【PAT】【Advanced Level】1080. Graduate Admission (30)
- PAT 甲级 1080. Graduate Admission (30)
- PAT 1015Graduate Admission (30)
- com.android.dx.cf.iface.ParseException
- python用类实现栈
- POJ
- QSS样式表
- 生产者/消费者的示例程序,生产者随机地产生若干个整数,消费者将这些整数输出到屏幕。
- PAT 1080. Graduate Admission (30) 已通过
- 题目24-素数距离问题
- 170905_个人机器学习初步计划
- 显示mac上隐藏的资源库文件方法
- 彻底理解样本方差为何除以n-1
- python os 模块常用命令
- C#中的SendKeys.Send操作CMD命令的问题
- 今天真是劳碌的一天
- <25>——Reverse Nodes in k-Group