九度OJ 1005 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 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.

输入：

Each input file may contain more than 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.

输出：

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.

样例输入：

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

样例输出：

思路：主要是按照题目要求堆代码，算法难度不高

code:

#include <bits/stdc++.h>
using namespace std ;
class student{public :int id ;float GE,GI,Final ;int zy[5] ;
};
bool compare (const student & a, const student &b){return a.id<b.id ;
}
class school{public :int quota , curNum; // 学校招生指标人数  已招生人数student *stu;school(){}void nschool(int quota){this->quota = quota;curNum = 0 ;stu = new student[quota+5];}bool acceptStu(student student){if (curNum<quota){stu[curNum++] = student;return true;}else {if (student.GE==stu[curNum-1].GE && student.GI == stu[curNum-1].GI){stu[curNum++] = student;return false ;}else{return false ;}}}~school(){delete []stu;}
};
bool cmp(const student &a , const student &b){if (a.Final!=b.Final)return (a.Final-b.Final)>0;return (a.GE - b.GE)>0 ;
}
int main (){int n,m,k;school * sch;student *stu ;while (cin>>n>>m>>k){int quota ;sch = new school[m];for (int i = 0 ; i < m ; ++i ){cin>>quota ;sch[i].nschool(quota);}stu = new student[n] ;for (int i= 0 ; i < n ; ++i){stu[i].id = i ;cin>>stu[i].GE>>stu[i].GI;stu[i].Final = (stu[i].GE+stu[i].GI)/2;for (int j = 0 ; j < k ;++j)cin>>stu[i].zy[j] ;}sort(stu , stu+n,cmp);for (int i = 0 ; i < n ; ++i){for(int j = 0 ; j < k ;++j){if (sch[stu[i].zy[j]].acceptStu(stu[i]))break;}}for (int i = 0 ; i < m ; ++i){if (sch[i].curNum==0)cout<<endl;else{sort(sch[i].stu,sch[i].stu+(sch[i].curNum), compare);for (int j = 0 ; j<sch[i].curNum ; ++j){cout<<sch[i].stu[j].id;if (j==sch[i].curNum-1)cout<<endl;elsecout<<" ";}}}delete []stu;delete []sch;}return 0;
}

九度OJ 1005 Graduate Admission相关推荐

打不开磁盘配额linux,九度OJ 1455 珍惜现在，感恩生活 -- 动态规划（背包问题）...
题目描述: 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买.请问:你用有限的资金最 ...
Freckles - 九度 OJ 1144
Freckles - 九度 OJ 1144 题目时间限制:1 秒内存限制:128 兆特殊判题:否题目描述: In an episode of the Dick Van Dyke show, l ...
非常可乐（九度 OJ 1457）
非常可乐(九度 OJ 1457) 时间限制:1 秒内存限制:32 兆特殊判题:否 1.题目描述: 大家一定觉的运动以后喝可乐是一件很惬意的事情,但是 seeyou 却不这么认为.因为每次当 see ...
九度OJ 题目1179：阶乘
/********************************* * 日期:2013-2-8 * 作者:SJF0115 * 题号: 九度OJ 题目1179:阶乘 * 来源:http://ac.jo ...
九度OJ——1028继续畅通工程
题目描述: 省政府"畅通工程"的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可).现得到城镇道路统计表,表中列出了任意两城镇间修 ...
Leagal or Not - 九度 OJ 1448
Leagal or Not - 九度 OJ 1448 题目时间限制:1 秒内存限制:128 兆特殊判题:否题目描述: ACM-DIY is a large QQ group where man ...
九度OJ 题目1069：查找学生信息随笔
** 九度OJ 题目1069:查找学生信息 ** 题目描述如下: 输入N个学生的信息,然后进行查询. 输入输入的第一行为N,即学生的个数(N<=1000) 接下来的N行包括N个学生的信息,信息 ...
九度OJ 题目1203：IP地址
/********************************* * 日期:2013-2-8 * 作者:SJF0115 * 题号: 九度OJ 题目1203:IP地址 * 来源:http://ac. ...
九度OJ 1024 畅通工程 -- 并查集、贪心算法(最小生成树)
题目地址:http://ac.jobdu.com/problem.php?pid=1024 题目描述: 省政府"畅通工程"的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有 ...

九度OJ 1005 Graduate Admission

九度OJ 1005 Graduate Admission相关推荐

最新文章

热门文章