【PAT】【Advanced Level】1080. Graduate Admission (30)
来源:互联网 发布:存量房数据采集 编辑:程序博客网 时间:2024/05/20 05:05
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
https://www.patest.cn/contests/pat-a-practise/1080
https://www.nowcoder.com/pat/5/problem/4310
思路:
结构体排序,再根据要求进行录取。
注意,最后输出的是原序号,所以对结果进行排序时需要针对原序号进行排序,而不是针对名次
CODE:
#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#define N 40010#define M 110#define K 5using namespace std;typedef struct S{int fir;int sec;int sum;int pre[K];int sno;};S stu[N];int maxs[M];vector<int> sch[M];bool cmp(S a, S b){if (a.sum==b.sum){return a.fir>b.fir;}elsereturn a.sum>b.sum;}bool cmpv(int a,int b){return stu[a].sno<stu[b].sno;}int main(){int n,m,k;//cin>>n>>m>>k;scanf("%d %d %d",&n,&m,&k);for (int i=0;i<m;i++){scanf("%d",&maxs[i]);}for (int i=0;i<n;i++){scanf("%d %d",&stu[i].fir,&stu[i].sec);stu[i].sum=stu[i].fir+stu[i].sec;stu[i].sno=i;for (int j=0;j<k;j++)scanf("%d",&stu[i].pre[j]);}sort(stu,stu+n,cmp);/*for (int i=0;i<n;i++){cout<<stu[i].sum<<" "<<stu[i].fir<<" "<<stu[i].sec<<endl;}*/for (int i=0;i<n;i++){for (int j=0;j<k;j++){int t=stu[i].pre[j];if (sch[t].size()<maxs[t]){sch[t].push_back(i);break;}else{if (maxs[t]==0) continue;int l;l=sch[t][sch[t].size()-1];if (stu[i].sum==stu[l].sum&&stu[i].fir==stu[l].fir){sch[t].push_back(i);break;}}}}for (int i=0;i<m;i++){sort(sch[i].begin(),sch[i].end(),cmpv);if(sch[i].size()!=0){for (int j=0;j<sch[i].size();j++){printf("%d",stu[sch[i][j]].sno);if (j!=sch[i].size()-1) printf(" ");}}printf("\n");}return 0;}
- PAT Advanced Level 1080. Graduate Admission (30)
- 【PAT】【Advanced Level】1080. Graduate Admission (30)
- PAT (Advanced) 1080. Graduate Admission (30)
- PAT (Advanced Level) Practise 1080 Graduate Admission (30)
- PAT (Advanced Level) Practise 1080 Graduate Admission (30)
- Pat(Advanced Level)Practice--1080(Graduate Admission)
- PAT (Advanced Level) 1080. Graduate Admission (30) 模拟高考录取,结构体排序
- 1080. Graduate Admission (30)【排序】——PAT (Advanced Level) Practise
- 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 A 1080. Graduate Admission (30)
- PAT(A) - 1080. Graduate Admission (30)
- 1080. Graduate Admission (30) PAT 甲级
- 计算机图形学 (二) 图元的属性
- javaee学习日记之java基础之接口,继承,抽象类
- jQuery源码学习笔记系列(二)
- Linux CentOS 6.3配置PHP开发环境
- 指定表名获取数据库内容-->泛型访问数据库-->注解方式访问数据库
- 【PAT】【Advanced Level】1080. Graduate Admission (30)
- Css sprites(Css精灵)
- session与cookie的介绍和两者的区别之其相互的关系
- OpenGL 笔记(二) 图元的属性
- 欢迎使用CSDN-markdown编辑器
- 100. Same Tree
- MySQL删除重复记录
- runable和thread的区别
- csu 1777