PAT 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
// 1080pat.cpp : 定义控制台应用程序的入口点。
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std; const int schools=; //最多的研究生院个数
vector<int> quota; //每个研究生院的限额 struct App
{
int num; //申请人编号,从0开始
int GE;
int GI;
int Final;
int rank; //申请人的排名
int choices[];
bool operator <(const App& rhs) const
{
if(Final==rhs.Final)
{
return GE>rhs.GE;
}
else
return Final>rhs.Final;
}
}; class T:public unary_function<App,bool> //for_each处理,得到每个申请人的相对排名
{
public:
T(App& aa):app(aa){}
bool operator()(App& a)
{
if(a.Final<app.Final)
{
a.rank=app.rank+;
}
else
{
if(a.GE<app.GE)
{
a.rank=app.rank+;
}
else
a.rank=app.rank;
}
app=a;
return true;
}
private:
App app;
};
vector<App> applicants; //所有的申请人
vector<int> res[schools]; //每个研究生院录取的申请人编号
int sranks[schools]; //每个研究生院录取的申请人的当前最新排名,用来处理case4 int main()
{
int N,M,K; //数据输入
cin>>N>>M>>K;
int qbuf;
int i;
for(i=;i<M;++i)
{
cin>>qbuf;
quota.push_back(qbuf);
}
for(i=;i<N;++i)
{
App Abuf; //每次定义一个,如果定义到外面的话,在App中要重载operator=
cin>>Abuf.GE>>Abuf.GI;
Abuf.Final=(Abuf.GE+Abuf.GI)>>;
for(int j=;j<K;++j)
{
cin>>Abuf.choices[j];
}
Abuf.num=i;
applicants.push_back(Abuf);
}
sort(applicants.begin(),applicants.end()); //排序
applicants[].rank=;
for_each(applicants.begin(),applicants.end(),T(applicants[])); //得到相对排名
for(vector<App>::iterator iter=applicants.begin();iter!=applicants.end();++iter)
{
for(int j=;j<K;++j)
{
//每个申请人的申请的第j个研究生院还有名额,或者跟之前录取的有相同的排名
if(quota[iter->choices[j]]>||sranks[iter->choices[j]]==iter->rank)
{
--quota[iter->choices[j]]; //研究生院的名额减少一个
res[iter->choices[j]].push_back(iter->num);//将录取的申请人添加到对应的研究生院
sranks[iter->choices[j]]=iter->rank; //更新对应研究生院的最新录取申请人的排名
break;
}
}
}
for(i=;i<M;++i)
{
int size=res[i].size();
if(==size)
cout<<endl;
else
{
sort(res[i].begin(),res[i].end());
for(int j=;j<size;++j)
{
if(!=j)
cout<<" ";
cout<<res[i][j];
}
cout<<endl;
}
}
return ;
}
C (gcc)
C# (mcs)
C++ (g++)
Go (gccgo)
Haskell (ghc)
Java (gcj)
Javascript (nodejs)
Lisp (clisp)
Lua (lua)
Pascal (fpc)
PHP (php)
Python (python3)
Python (python2)
Ruby (ruby)
Scheme (guile)
Shell (bash)
Vala (valac)
VisualBasic (vbnc)
代码
1
PAT 1080. Graduate Admission (30)的更多相关文章
- pat 甲级 1080. Graduate Admission (30)
1080. Graduate Admission (30) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue It ...
- PAT 甲级 1080 Graduate Admission (30 分) (简单,结构体排序模拟)
1080 Graduate Admission (30 分) It is said that in 2011, there are about 100 graduate schools ready ...
- PAT 1080 Graduate Admission[排序][难]
1080 Graduate Admission(30 分) It is said that in 2011, there are about 100 graduate schools ready to ...
- PAT (Advanced Level) 1080. Graduate Admission (30)
简单题. #include<cstdio> #include<cstring> #include<cmath> #include<vector> #in ...
- 【PAT甲级】1080 Graduate Admission (30 分)
题意: 输入三个正整数N,M,K(N<=40000,M<=100,K<=5)分别表示学生人数,可供报考学校总数,学生可填志愿总数.接着输入一行M个正整数表示从0到M-1每所学校招生人 ...
- 1080. Graduate Admission (30)
时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue It is said that in 2013, there w ...
- 1080 Graduate Admission (30)(30 分)
It is said that in 2013, there were about 100 graduate schools ready to proceed over 40,000 applicat ...
- PAT 1080. Graduate Admission
It is said that in 2013, there were about 100 graduate schools ready to proceed over 40,000 applicat ...
- 1080. Graduate Admission (30)-排序
先对学生们进行排序,并且求出对应排名. 对于每一个学生,按照志愿的顺序: 1.如果学校名额没满,那么便被该学校录取,并且另vis[s][app[i].ranks]=1,表示学校s录取了该排名位置的学生 ...
随机推荐
- MOS管应用之放反接电路
一.典型电路 1.电路1 说明: GND-IN 为电源接口的负极 GND 为内部电路的公共地 原理分析 正向接: VCC-IN通过R1.R2.MOS体二极管,最后回到GND-IN;然后GS电压升高,紧 ...
- json序列化后日期如何变回来
日期格式为 日期小于10的时候 占一位 比如 2019年9月1日 2015/9/1 function ChangeDateFormat(cellval) { var date = ...
- Android源码学习之装饰模式应用
首先得了解最基础的装饰器模式 参考 设计模式之八 --- 装饰模式(Decorator) 参考链接:http://blog.csdn.net/cjjky/article/details/7478788 ...
- ajax跨域调用
http://redsky008.iteye.com/blog/1754328 http://www.cnblogs.com/mahatmasmile/archive/2013/03/29/29895 ...
- C语言清空输入缓冲区的N种方法对比
转自C语言清空输入缓冲区的N种方法对比 C语言中有几个基本输入函数: //获取字符系列 int fgetc(FILE *stream); int getc(FILE *stream); int get ...
- c# gzip解压缩
, bytes.Length)) > ) { line = System.Text.Encoding.Defaul ...
- 李洪强漫谈iOS开发[C语言-029] - 关系运算符
- [topcoder]IncreasingSubsequences
http://community.topcoder.com/stat?c=problem_statement&pm=7753&rd=10672 http://community.top ...
- QQ协议的TEA加解密算法
QQ通讯协议里的加解密算法. #include <stdio.h> #include <stdlib.h> #include <memory.h> #include ...
- 【java并发】线程同步工具Semaphore的使用
Semaphore通常用于限制可以访问某些资源(物理或逻辑的)的线程数目,我们可以自己设定最大访问量.它有两个很常用的方法是acquire()和release(),分别是获得许可和释放许可. 官方J ...