pat 1080 Graduate Admission
来源:互联网 发布:117s发动机数据 编辑:程序博客网 时间:2024/06/08 18:44
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 <map>#include <vector>#include <algorithm>using namespace std;struct Stu{double GE, GI;double avg;int stuID;vector<int> choice;};bool cmp(const Stu &stu1, const Stu &stu2) {if(stu1.avg != stu2.avg) {return stu1.avg > stu2.avg;} else {return stu1.GE > stu2.GE;}}vector<Stu> vec;vector<int> schoolQuta;int main() {int N, M, K;scanf("%d %d %d", &N, &M, &K);double GE, GI;map<int, int> rank;vector<int> schoolUsedQuta(M, 0);vector<vector<int> > schoolAdmitStu(M);for (int i = 0; i < M; ++i){int x;scanf("%d", &x);schoolQuta.push_back(x);}for (int i = 0; i < N; ++i){Stu stu;scanf("%lf %lf", &GE, &GI);stu.GE = GE;stu.GI = GI;stu.avg = (GE+GI)/2;stu.stuID = i;for (int j = 0; j < K; ++j){int x;scanf("%d", &x);stu.choice.push_back(x);}vec.push_back(stu);}sort(vec.begin(), vec.end(), cmp);for (int i = 0; i < N; ++i){rank[vec[i].stuID]=i;}for (int i = 0; i < N; ++i){Stu stu = vec[i];for (int j = 0; j < K; ++j){if(schoolUsedQuta[stu.choice[j]] < schoolQuta[stu.choice[j]]) {schoolUsedQuta[stu.choice[j]]++;schoolAdmitStu[stu.choice[j]].push_back(vec[i].stuID);break;} else {int k = stu.choice[j];int lastId = schoolAdmitStu[k][schoolAdmitStu[k].size()-1];if(vec[rank[lastId]].avg == stu.avg && vec[rank[lastId]].GE==stu.GE) {schoolAdmitStu[k].push_back(stu.stuID);schoolUsedQuta[k]++;break;}}}}for (int i = 0; i < M; ++i){sort(schoolAdmitStu[i].begin(), schoolAdmitStu[i].end());}for (int i = 0; i < M; ++i){for (int j = 0; j < schoolAdmitStu[i].size(); ++j){if(j == 0) printf("%d", schoolAdmitStu[i][j]);else printf(" %d", schoolAdmitStu[i][j]);}printf("\n");}return 0;}
- PAT 1080 Graduate Admission
- PAT 1080Graduate Admission
- pat 1080 Graduate Admission
- PAT 1080-Graduate Admission (30)
- Pat(Advanced Level)Practice--1080(Graduate Admission)
- 【PAT】1080. Graduate 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-A1080. Graduate Admission (30)
- PAT A1080. Graduate Admission (30)
- PAT A1080 graduate admission (30)
- PAT A1080. Graduate Admission (30)
- PAT (Advanced Level) Practise 1080 Graduate Admission (30)
- 那些年…一个文科男对理工男的逆袭,震惊了!
- 转自http://www.cnblogs.com/jscode/archive/2012/07/10/2583856.html
- Codeforces 545E Paths and Trees
- cocos2d 更换皮肤
- TF-IDF与余弦相似性的应用(二):找出相似文章
- pat 1080 Graduate Admission
- 传感器
- IOS 类似网易音乐HD版左侧栏实现 --使用Autolayout控制右侧ViewController布局是遇到的问题
- 详解spring事务属性 <转
- UUID of GATT characteristic
- 机器学习算法▬▬▬极速学习机
- SELinux架构和Flask安全体系结构的一些认识
- nyist
- C++中的定位放置new(placement new)