PAT甲级——A1080 Graduate Admission

It is said that in 2011, there are 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 G?E??, and the interview grade G?I??. The final grade of an applicant is (. 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 G?E??. 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 (≤), the total number of applicants; M (≤), the total number of graduate schools; and K (≤), 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 integers separated by a space. The first 2 integers are the applicant‘s G?E?? and G?I??, 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
 1 #include <iostream>
 2 #include <vector>
 3 #include <algorithm>
 4 //录取规则,排名靠前的人优先选择学校
 5 using namespace std;
 6 int N, M, K;
 7 struct Node
 8 {
 9     int id, Ge, Gt, G, rank, choice[6];
10 }node;
11 struct Sch
12 {
13     int quto;
14     vector<pair<int,int>>admin;//录取的学生id,rank
15 }sch;
16 vector<Sch>school;
17 vector<Node>applicant;
18 bool cmp(Node a, Node b)
19 {
20     if (a.G != b.G)
21         return a.G > b.G;
22     else
23         return a.Ge > b.Ge;
24 }
25 int main()
26 {
27     cin >> N >> M >> K;
28     for (int i = 0; i < M; ++i)
29     {
30         cin >> sch.quto;
31         school.push_back(sch);
32     }
33     for (int i = 0; i < N; ++i)
34     {
35         cin >> node.Ge >> node.Gt;
36         node.G = node.Ge + node.Gt;
37         node.id = i;
38         for (int j = 0; j < K; ++j)
39         {
40             int t;
41             cin >> t;
42             node.choice[j] = t;//志愿学校
43         }
44         applicant.push_back(node);
45     }
46     sort(applicant.begin(), applicant.end(), cmp);
47     applicant[0].rank = 1;
48     for (int i = 1; i < N; ++i)//排名
49     {
50         if (applicant[i].G == applicant[i - 1].G && applicant[i].Ge == applicant[i - 1].Ge)
51             applicant[i].rank = applicant[i - 1].rank;
52         else
53             applicant[i].rank = i + 1;
54     }
55     for (int i = 0; i < N; ++i)//按学生选学校
56     {
57         for (int j = 0; j < K; ++j)
58         {
59             int t = applicant[i].choice[j];
60             if (school[t].quto == 0 && (school[t].admin.end() - 1)->second == applicant[i].rank)//排名相同可以超额
61             {
62                 school[t].admin.push_back(make_pair(applicant[i].id, applicant[i].rank));//超额录取
63                 break;
64             }
65             else if (school[t].quto == 0)
66                 continue;//面试下一所学校,该学校满额
67             else
68             {
69                 school[t].admin.push_back(make_pair(applicant[i].id, applicant[i].rank));//正常录取
70                 school[t].quto--;//名额减少
71                 break;
72             }
73         }
74     }
75     for (int i = 0; i < M; ++i)
76     {
77         sort(school[i].admin.begin(), school[i].admin.end());
78         for (int j = 0; j < school[i].admin.size(); ++j)
79             cout << school[i].admin[j].first << (j == school[i].admin.size() - 1 ? "" : " ");
80         cout << endl;
81     }
82     return 0;
83 }

原文地址:https://www.cnblogs.com/zzw1024/p/11326552.html

时间: 2024-10-09 01:06:45

PAT甲级——A1080 Graduate Admission的相关文章

PAT A1080 Graduate Admission

PAT A1080 Graduate Admission 题目描述: It is said that in 2011, there are 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. Eac

PAT(A) 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 t

PAT:1080. Graduate Admission (30) AC

#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; struct Student { int GE,GI,sum,rank,ID; int prefer[6]; }STU[40066]; struct School { int want; //各学校招生人数 int get; //已招到的人数 int line; //最后一名进来的排名线 int queue[4006

PAT:1080. Graduate Admission (30) 全错

#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; struct Student { int GE,GI,sum,rank,ID; int prefer[6]; }STU[40066]; struct School { int want; //各学校招生人数 int get; //已招到的人数 int line; //最后一名进来的排名线 int queue[4006

PAT:1080. Graduate Admission (30) 部分错误(录取以学校为导向而不是考生志愿为导向导致的错误)

#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int want[106]; //各学校招生人数 struct Student { int GE,GI,sum,rank,ID; int prefer[6]; bool R; //代表该生录取情况 }STU[40066]; bool cmp(Student a,Student b) { if(a.sum!=b.sum

PAT 甲级 A1080 (2019/02/18)

#include<cstdio> #include<algorithm> using namespace std; struct Student{ int GE, GI, SUM; //初试分,面试分,总分 int rank, stuID; //名次, 考生id int cho[6]; //志愿 }stu[40010]; struct School{ int quota; //招生人数 int stuNum; //实际招生人数 int ID[40010]; //招收学生的编号 in

PAT 1080. Graduate Admission (30)

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 ap

PAT甲级1005 Spell It Right

题目:PAT甲级 1005 题解:水题.看到题目的第一时间就在想一位一位的mod,最后一加一转换就完事了.结果看到了N最大为10的100的次方,吓得我赶紧放弃这个想法... 发现碰到这种情况用字符串十分好用,这道题应该考察的就是这一点.大致思路就是把数字的每一位放到字符串中,然后通过ASCII码得到每一位的相加结果num,然后把num一位一位的放到stack中,使用stack是因为它先进先出的特性,最后输出就行了. 代码: 1 #include<cstdio> 2 #include<qu

pat1080. Graduate Admission (30)

1080. Graduate Admission (30) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue 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 yo