| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1013260 |
2024-07-03T10:51:16 Z |
d4xn |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
34364 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5+5;
int n;
vector<int> lp[N];
void init(int nn, int a[], int b[]) {
n = nn;
for (int i = 0; i < n; i++) {
lp[a[i]].push_back(b[i]);
}
}
int can(int m, int k[]) {
sort(k, k+m);
int L = 0;
int ok = 1;
priority_queue<int> pq;
for (int i = 1; i <= n; i++) {
for (int& j : lp[i]) {
pq.push(-j);
}
while (L < m && k[L] == i) {
int c = k[L];
while (!pq.empty() && c) {
pq.pop();
c--;
}
if (c) {
ok = 0;
break;
}
L++;
}
if (L == m) break;
while (!pq.empty() && -pq.top() <= i) pq.pop();
}
//cerr << ok << endl;
return ok;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 2 |
Correct |
3 ms |
12380 KB |
Output is correct |
| 3 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 4 |
Correct |
3 ms |
12120 KB |
Output is correct |
| 5 |
Correct |
3 ms |
12124 KB |
Output is correct |
| 6 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 7 |
Correct |
3 ms |
12376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 9 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 10 |
Correct |
2 ms |
12176 KB |
Output is correct |
| 11 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 12 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 13 |
Correct |
2 ms |
12184 KB |
Output is correct |
| 14 |
Correct |
2 ms |
12176 KB |
Output is correct |
| 15 |
Correct |
3 ms |
12124 KB |
Output is correct |
| 16 |
Correct |
3 ms |
12188 KB |
Output is correct |
| 17 |
Correct |
2 ms |
12172 KB |
Output is correct |
| 18 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 19 |
Correct |
2 ms |
11944 KB |
Output is correct |
| 20 |
Correct |
3 ms |
12376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 22 |
Correct |
2 ms |
12180 KB |
Output is correct |
| 23 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 24 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 25 |
Correct |
2 ms |
12124 KB |
Output is correct |
| 26 |
Correct |
2 ms |
12124 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
16212 KB |
Output is correct |
| 2 |
Correct |
22 ms |
16216 KB |
Output is correct |
| 3 |
Correct |
22 ms |
16216 KB |
Output is correct |
| 4 |
Correct |
24 ms |
16804 KB |
Output is correct |
| 5 |
Correct |
8 ms |
14424 KB |
Output is correct |
| 6 |
Correct |
7 ms |
14424 KB |
Output is correct |
| 7 |
Correct |
7 ms |
14424 KB |
Output is correct |
| 8 |
Correct |
7 ms |
14428 KB |
Output is correct |
| 9 |
Correct |
8 ms |
14884 KB |
Output is correct |
| 10 |
Correct |
7 ms |
14548 KB |
Output is correct |
| 11 |
Correct |
7 ms |
14548 KB |
Output is correct |
| 12 |
Correct |
8 ms |
14636 KB |
Output is correct |
| 13 |
Correct |
12 ms |
14940 KB |
Output is correct |
| 14 |
Correct |
16 ms |
15640 KB |
Output is correct |
| 15 |
Correct |
13 ms |
15708 KB |
Output is correct |
| 16 |
Correct |
21 ms |
15944 KB |
Output is correct |
| 17 |
Correct |
11 ms |
14684 KB |
Output is correct |
| 18 |
Correct |
12 ms |
14820 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2382 ms |
17112 KB |
Output is correct |
| 2 |
Correct |
2744 ms |
17108 KB |
Output is correct |
| 3 |
Execution timed out |
4027 ms |
16612 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4016 ms |
34364 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
