제출 #1279837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1279837		proplayer	팀들 (IOI15_teams)	C++20	34 / 100	4094 ms	12292 KiB

teams

#include "teams.h"

#include<bits/stdc++.h>
using namespace std;
const int maxN = 5e5 + 5;
using ll = long long;


int a[maxN], b[maxN], n, m, k[maxN], id[maxN];
priority_queue<int, vector<int>, greater<int>> q;
bool cmp(int x, int y)
{
    return a[x] < a[y];
}
void init(int N, int A[], int B[])
{
    n = N;
    for (int i = 1; i <= n; ++i) a[i] = A[i - 1];
    for (int i = 1; i <= n; ++i) b[i] = B[i - 1];
    for (int i = 1; i <= n; ++i) id[i] = i;
    sort(id + 1, id + n + 1, cmp);
}

int can(int M, int K[])
{
    m = M;
    for (int i = 1; i <= m; ++i) k[i] = K[i - 1];
    sort(k + 1, k + m + 1);
    while (!q.empty()) q.pop();
    int j = 1;
    for (int i = 1; i <= m; ++i)
    {
        while (j <= n && a[id[j]] <= k[i])
        {
            q.push(b[id[j]]);
            ++j;
        }
        while (!q.empty() && q.top() < k[i]) q.pop();
        int cnt = k[i];
        while (cnt > 0)
        {
            if (q.empty()) return 0;
            q.pop();
            --cnt;
        }
    }
    return 1;
}

• Subtask 1: 21 / 21
• Subtask 2: 13 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23