| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 528335 |
2022-02-20T04:07:15 Z |
Cyanmond |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
32700 KB |
// clang-format off
#include <bits/stdc++.h>
int N;
std::vector<int> A, B;
void init(int n, int a[], int b[]) {
N = n;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; ++i) {
A[i] = a[i];
B[i] = b[i];
}
}
int internal_can(const int M, std::vector<int> K) {
int sum = 0;
// overflow
for (int i = 0; i < M; ++i) {
sum += K[i];
if (sum > N) return 0;
}
std::sort(K.begin(), K.end());
std::vector<std::vector<int>> event_a(N + 1);
for (int i = 0; i < N; ++i) event_a[A[i]].push_back(B[i] + 1);
std::vector<int> event_q(N + 1);
for (int i = 0; i < M; ++i) ++event_q[K[i]];
std::priority_queue<int, std::vector<int>, std::greater<int>> pq;
for (int i = 1; i <= N; ++i) {
for (const int r : event_a[i]) pq.push(r);
while (event_q[i]--) {
int c = i;
while (c--) {
while ((not pq.empty()) and pq.top() <= i) pq.pop();
if (pq.empty()) return 0;
pq.pop();
}
}
}
return 1;
}
int can(int M, int K[]) {
std::vector<int> k(M);
for (int i = 0; i < M; ++i) k[i] = K[i];
return internal_can(M, k);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
2 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
288 KB |
Output is correct |
| 8 |
Correct |
1 ms |
292 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct |
| 12 |
Correct |
1 ms |
208 KB |
Output is correct |
| 13 |
Correct |
1 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
300 KB |
Output is correct |
| 15 |
Correct |
2 ms |
312 KB |
Output is correct |
| 16 |
Correct |
1 ms |
208 KB |
Output is correct |
| 17 |
Correct |
1 ms |
296 KB |
Output is correct |
| 18 |
Correct |
1 ms |
208 KB |
Output is correct |
| 19 |
Correct |
1 ms |
300 KB |
Output is correct |
| 20 |
Correct |
1 ms |
208 KB |
Output is correct |
| 21 |
Correct |
1 ms |
208 KB |
Output is correct |
| 22 |
Correct |
1 ms |
208 KB |
Output is correct |
| 23 |
Correct |
1 ms |
208 KB |
Output is correct |
| 24 |
Correct |
1 ms |
208 KB |
Output is correct |
| 25 |
Correct |
1 ms |
296 KB |
Output is correct |
| 26 |
Correct |
1 ms |
296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
6288 KB |
Output is correct |
| 2 |
Correct |
16 ms |
6348 KB |
Output is correct |
| 3 |
Correct |
27 ms |
6972 KB |
Output is correct |
| 4 |
Correct |
17 ms |
7500 KB |
Output is correct |
| 5 |
Correct |
8 ms |
5292 KB |
Output is correct |
| 6 |
Correct |
10 ms |
5324 KB |
Output is correct |
| 7 |
Correct |
6 ms |
5228 KB |
Output is correct |
| 8 |
Correct |
7 ms |
6020 KB |
Output is correct |
| 9 |
Correct |
11 ms |
6916 KB |
Output is correct |
| 10 |
Correct |
9 ms |
6464 KB |
Output is correct |
| 11 |
Correct |
9 ms |
6264 KB |
Output is correct |
| 12 |
Correct |
10 ms |
6436 KB |
Output is correct |
| 13 |
Correct |
14 ms |
6568 KB |
Output is correct |
| 14 |
Correct |
17 ms |
7360 KB |
Output is correct |
| 15 |
Correct |
18 ms |
8016 KB |
Output is correct |
| 16 |
Correct |
14 ms |
7344 KB |
Output is correct |
| 17 |
Correct |
15 ms |
6472 KB |
Output is correct |
| 18 |
Correct |
13 ms |
6504 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1698 ms |
7332 KB |
Output is correct |
| 2 |
Correct |
1976 ms |
7176 KB |
Output is correct |
| 3 |
Execution timed out |
4070 ms |
7244 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4073 ms |
32700 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
