Submission #551352

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
551352	2022-04-20T13:31:35 Z	tabr	Teams (IOI15_teams)	C++17	34 / 100	4000 ms	21908 KB

teams

#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

int n;
vector<pair<int, int>> c;

void init(int n_, int a[], int b[]) {
    n = n_;
    for (int i = 0; i < n; i++) {
        c.emplace_back(a[i], b[i]);
    }
    sort(c.begin(), c.end());
}

int can(int m, int k[]) {
    if (accumulate(k, k + m, 0LL) > n) {
        return 0;
    }
    vector<int> d(n + 1);
    for (int i = 0; i < m; i++) {
        d[k[i]] += k[i];
    }
    int id = 0;
    multiset<int> st;
    for (int i = 1; i <= n; i++) {
        while (id < n && c[id].first == i) {
            st.emplace(c[id].second);
            id++;
        }
        if ((int) st.size() < d[i]) {
            return 0;
        }
        for (int j = 0; j < d[i]; j++) {
            st.erase(st.begin());
        }
        st.erase(i);
    }
    return 1;
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    return 0;
}
#endif

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	2 ms	296 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	2 ms	308 KB	Output is correct
13	Correct	2 ms	212 KB	Output is correct
14	Correct	2 ms	212 KB	Output is correct
15	Correct	2 ms	212 KB	Output is correct
16	Correct	2 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	2264 KB	Output is correct
2	Correct	17 ms	2252 KB	Output is correct
3	Correct	40 ms	4568 KB	Output is correct
4	Correct	17 ms	2648 KB	Output is correct
5	Correct	20 ms	2268 KB	Output is correct
6	Correct	19 ms	2952 KB	Output is correct
7	Correct	13 ms	2964 KB	Output is correct
8	Correct	13 ms	2972 KB	Output is correct
9	Correct	36 ms	7816 KB	Output is correct
10	Correct	33 ms	7492 KB	Output is correct
11	Correct	32 ms	7424 KB	Output is correct
12	Correct	31 ms	7296 KB	Output is correct
13	Correct	33 ms	5792 KB	Output is correct
14	Correct	40 ms	7600 KB	Output is correct
15	Correct	46 ms	5408 KB	Output is correct
16	Correct	16 ms	3392 KB	Output is correct
17	Correct	27 ms	4316 KB	Output is correct
18	Correct	27 ms	4568 KB	Output is correct

Subtask #3

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	2632 KB	Output is correct
2	Correct	20 ms	2964 KB	Output is correct
3	Execution timed out	4086 ms	4624 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	103 ms	11972 KB	Output is correct
2	Correct	103 ms	12596 KB	Output is correct
3	Execution timed out	4062 ms	21908 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-