PAT A1080 Graduate Admission (30)

最新推荐文章于 2021-02-18 19:32:52 发布

friedmudball

最新推荐文章于 2021-02-18 19:32:52 发布

阅读量175

点赞数

分类专栏： PAT 文章标签： PAT 甲级浙大

本文链接：https://blog.csdn.net/fried123123/article/details/81385285

版权

PAT 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

解题思路：

基本思路是依照题目给定的规则排序，然后遍历结构体，将对应的申请送到对应学校的队列中（这里用了优先队列，是直接排好序的）。
学校也可以构造结构体来储存申请，遍历完申请可以直接再排一下序。

AC代码

// grade1 grade2 final = (grade1 + grade2) / 2
// ranked by final
// if a tie ranked by grade1, if still a tie, they have same rank
// k choices
// first choice full, try second, try third, or rejected
// *** if some has same rank and same choices, school must accept all even if will be exceeded
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <functional>
using namespace std;

const int maxn = 40010, maxm = 110, maxk = 5;
//int applicants[maxn]{ 0 };
struct applicant {
    int id, g1, g2, f, r, choices[maxk];
} app[maxn];

bool cmp(applicant a, applicant b) {
    if (a.f != b.f) return a.f > b.f;
    else if (a.g1 != b.g1) return a.g1 > b.g1;
    else return a.g2 > b.g2;                            // 表示rank相同
}
void init() {
    for (int i = 0; i < maxn; i++) {
        app[i].r = 0;
        memset(app[i].choices, -1, sizeof(app[i].choices));
    }
}

int school[maxm]{ 0 };
priority_queue<int, vector<int>, greater<int>> received[maxm];
int main() {
    int n, m, k, i, j;
    scanf("%d%d%d", &n, &m, &k);

    for (i = 0; i < m; i++)
        scanf("%d", &school[i]);
    init();
    for (i = 0; i < n; i++) {
        app[i].id = i;
        scanf("%d%d", &app[i].g1, &app[i].g2);
        app[i].f = app[i].g1 + app[i].g2;
        for (j = 0; j < k; j++)
            scanf("%d", &app[i].choices[j]);
    }

    sort(app, app + n, cmp);
    // ranking
    app[0].r = 1;
    for ( i = 1; i < n; i++)
    {
        if (app[i].f == app[i - 1].f) {
            if (app[i].g1 == app[i - 1].g1)
                app[i].r = app[i - 1].r;
            else
                app[i].r = i + 1;
        }
        else
            app[i].r = i + 1;
    }
    int lastrank = 0, lastreceived = -1;
    for ( i = 0; i < n; i++)
    {
        int a;
        for ( j = 0; j < k; j++)
        {
            a = app[i].choices[j];
            if (school[a] > 0) {
                school[a]--;
                received[a].push(app[i].id);
                break;
            }
            else if (school[a] == 0 && lastrank == app[i].r && lastreceived == j)
            {
                received[a].push(app[i].id);
                break;
            }
        }
        lastrank = app[i].r;
        lastreceived = j;
    }

    for ( i = 0; i < m; i++)
    {
        j = received[i].size();

        while (!received[i].empty())
        {
            printf("%d", received[i].top());
            received[i].pop();
            if (!received[i].empty())
                printf(" ");
        }
        printf("\n");
    }

    return 0;
}