#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a, b;
vector<array<int, 2>> v;
int can(int M, int K[]) {
sort(K, K + M);
map<int, int> frq;
for (int j = 0, i = 0; j < M; ++j) {
for (; i < n && v[i][0] <= K[j]; ++i) ++frq[v[i][1]];
auto it = frq.lower_bound(K[j]);
while (K[j] && it != frq.end()) {
if (it->second <= K[j]) {
K[j] -= it->second;
it->second = 0;
} else {
it->second -= K[j];
K[j] = 0;
}
++it;
}
// cerr << K[j] << endl;
if (K[j]) return 0;
}
return 1;
}
void init(int N, int A[], int B[]) {
n = N;
a.resize(n);
b.resize(n);
v.resize(n);
for (int i = 0; i < n; ++i) {
a[i] = A[i];
b[i] = B[i];
v[i] = {a[i], b[i]};
}
sort(v.begin(), v.end());
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
300 KB |
Output is correct |
12 |
Correct |
1 ms |
304 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
300 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 |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
22 |
Correct |
0 ms |
212 KB |
Output is correct |
23 |
Correct |
1 ms |
212 KB |
Output is correct |
24 |
Correct |
0 ms |
212 KB |
Output is correct |
25 |
Correct |
0 ms |
212 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
2644 KB |
Output is correct |
2 |
Correct |
15 ms |
2668 KB |
Output is correct |
3 |
Correct |
37 ms |
5196 KB |
Output is correct |
4 |
Correct |
18 ms |
3048 KB |
Output is correct |
5 |
Correct |
14 ms |
2660 KB |
Output is correct |
6 |
Correct |
14 ms |
2664 KB |
Output is correct |
7 |
Correct |
12 ms |
2644 KB |
Output is correct |
8 |
Correct |
14 ms |
3408 KB |
Output is correct |
9 |
Correct |
11 ms |
3608 KB |
Output is correct |
10 |
Correct |
9 ms |
3156 KB |
Output is correct |
11 |
Correct |
10 ms |
3156 KB |
Output is correct |
12 |
Correct |
11 ms |
3256 KB |
Output is correct |
13 |
Correct |
20 ms |
3860 KB |
Output is correct |
14 |
Correct |
25 ms |
4780 KB |
Output is correct |
15 |
Correct |
16 ms |
3668 KB |
Output is correct |
16 |
Correct |
17 ms |
3764 KB |
Output is correct |
17 |
Correct |
15 ms |
3668 KB |
Output is correct |
18 |
Correct |
15 ms |
3632 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
3036 KB |
Output is correct |
2 |
Correct |
21 ms |
3028 KB |
Output is correct |
3 |
Execution timed out |
4088 ms |
5324 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
12824 KB |
Output is correct |
2 |
Correct |
96 ms |
12904 KB |
Output is correct |
3 |
Execution timed out |
4086 ms |
25432 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |