1080. Graduate Admission (30)
2016-12-11 21:40
309 查看
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 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
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <memory.h>
typedef struct
{
int id;
int GE;
int GI;
int avg;
int rank;
int choice[5];
int school;
}STUDENT;
STUDENT student[40010];
int school[110];
int cmp(const void *a, const void *b)
{
STUDENT *c = (STUDENT *)a;
STUDENT *d = (STUDENT *)b;
if (c->avg != d->avg)
{
return d->avg - c->avg;
}
else
{
return d->GE - c->GE;
}
}
int cmp2(const void *a, const void *b)
{
STUDENT *c = (STUDENT *)a;
STUDENT *d = (STUDENT *)b;
if (c->school != d->school)
{
return c->school - d->school;
}
return c->id - d->id;
}
int main()
{
int N, M, K, i, j;
int queue[50000];
int start, end;
int rank, temp;
int flag;
//freopen("d:\\input.txt", "r", stdin);
scanf("%d%d%d", &N, &M, &K);
for (i = 0; i < M; ++i)
{
scanf("%d", &school[i]);
}
for (i = 0; i < N; ++i)
{
student[i].id = i;
student[i].school = INT_MAX;
scanf("%d%d", &student[i].GE, &student[i].GI);
student[i].avg = (student[i].GE + student[i].GI) / 2;
for (j = 0; j < K; ++j)
{
scanf("%d", &student[i].choice[j]);
}
}
qsort(student, N, sizeof(student[0]), cmp);
rank = 1;
student[0].rank = rank;
for (i = 1; i < N; ++i)
{
if (student[i].avg == student[i - 1].avg)
{
if (student[i].GE == student[i - 1].GE)
{
student[i].rank = rank;
continue;
}
}
student[i].rank = ++rank;
}
start = 0;
end = 0;
rank = 1;
for (i = 0; i < N; ++i)
{
if (student[i].rank != rank)
{
while (start != end)
{
school[queue[start++]]--;
}
rank = student[i].rank;
}
for (j = 0; j < K; ++j)
{
if (school[student[i].choice[j]] > 0)
{
break;
}
}
if (j != K)
{
student[i].school = student[i].choice[j];
queue[end++] = student[i].choice[j];
}
}
while (start != end)
{
school[queue[start++]]--;
}
qsort(student, N, sizeof(student[0]), cmp2);
j = 0;
for (i = 0; i < M; ++i)
{
flag = 0;
while (j < N && student[j].school == i)
{
if (!flag)
{
printf("%d", student[j].id);
flag = 1;
}
else
{
printf(" %d", student[j].id);
}
++j;
}
puts("");
}
return 0;
}
相关文章推荐
- 如何组织构建多文件 C 语言程序(二)
- 如何写好 C main 函数
- Lua和C语言的交互详解
- 关于C语言中参数的传值问题
- 简要对比C语言中三个用于退出进程的函数
- 深入C++中API的问题详解
- 基于C语言string函数的详解
- C语言中fchdir()函数和rewinddir()函数的使用详解
- 浅谈C语言转义字符和格式控制符
- C语言内存对齐实例详解
- C语言编程中统计输入的行数以及单词个数的方法
- C 语言简单加减乘除运算
- C语言自动生成enum值和名字映射代码
- C语言练习题:自由落体的小球简单实例
- 使用C语言判断英文字符大小写的方法
- c语言实现的带通配符匹配算法
- C语言实现顺序表基本操作汇总
- C语言中进制知识汇总
- C语言判断一个数是否是2的幂次方或4的幂次方
- C语言二进制思想以及数据的存储