# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
596966 |
2022-07-15T10:26:27 Z |
PiejanVDC |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
55048 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>v((int)5e5+5);
void init(int n, int a[], int b[]) {
for(int i = 0 ; i < n ; i++) {
v[a[i]].push_back(b[i]);
}
}
int can(int m, int k[]) {
sort(k, k + m);
multiset<int>s;
int p = 0;
for(int i = 0 ; i < m ; i++) {
while(p <= k[i]) {
for(auto z : v[p])
s.insert(z);
p++;
}
while(k[i] && (int)s.size() > 0) {
if(*s.begin() >= k[i])
k[i]--;
s.erase(s.begin());
}
if(k[i])
return 0;
}
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
11988 KB |
Output is correct |
2 |
Correct |
6 ms |
11988 KB |
Output is correct |
3 |
Correct |
9 ms |
11988 KB |
Output is correct |
4 |
Correct |
7 ms |
12056 KB |
Output is correct |
5 |
Correct |
7 ms |
12052 KB |
Output is correct |
6 |
Correct |
8 ms |
12076 KB |
Output is correct |
7 |
Correct |
8 ms |
11988 KB |
Output is correct |
8 |
Correct |
9 ms |
12056 KB |
Output is correct |
9 |
Correct |
8 ms |
12056 KB |
Output is correct |
10 |
Correct |
9 ms |
12056 KB |
Output is correct |
11 |
Correct |
6 ms |
12048 KB |
Output is correct |
12 |
Correct |
8 ms |
12060 KB |
Output is correct |
13 |
Correct |
8 ms |
11988 KB |
Output is correct |
14 |
Correct |
7 ms |
11988 KB |
Output is correct |
15 |
Correct |
7 ms |
12052 KB |
Output is correct |
16 |
Correct |
7 ms |
11988 KB |
Output is correct |
17 |
Correct |
7 ms |
11976 KB |
Output is correct |
18 |
Correct |
6 ms |
12056 KB |
Output is correct |
19 |
Correct |
7 ms |
12012 KB |
Output is correct |
20 |
Correct |
7 ms |
11988 KB |
Output is correct |
21 |
Correct |
8 ms |
11988 KB |
Output is correct |
22 |
Correct |
7 ms |
12052 KB |
Output is correct |
23 |
Correct |
7 ms |
11964 KB |
Output is correct |
24 |
Correct |
6 ms |
11988 KB |
Output is correct |
25 |
Correct |
7 ms |
11988 KB |
Output is correct |
26 |
Correct |
7 ms |
12012 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
15772 KB |
Output is correct |
2 |
Correct |
22 ms |
15700 KB |
Output is correct |
3 |
Correct |
48 ms |
20036 KB |
Output is correct |
4 |
Correct |
21 ms |
16332 KB |
Output is correct |
5 |
Correct |
22 ms |
14288 KB |
Output is correct |
6 |
Correct |
21 ms |
14232 KB |
Output is correct |
7 |
Correct |
14 ms |
14328 KB |
Output is correct |
8 |
Correct |
12 ms |
14208 KB |
Output is correct |
9 |
Correct |
38 ms |
18756 KB |
Output is correct |
10 |
Correct |
40 ms |
18436 KB |
Output is correct |
11 |
Correct |
33 ms |
18368 KB |
Output is correct |
12 |
Correct |
26 ms |
18264 KB |
Output is correct |
13 |
Correct |
30 ms |
17068 KB |
Output is correct |
14 |
Correct |
38 ms |
19400 KB |
Output is correct |
15 |
Correct |
20 ms |
16128 KB |
Output is correct |
16 |
Correct |
18 ms |
15564 KB |
Output is correct |
17 |
Correct |
25 ms |
15672 KB |
Output is correct |
18 |
Correct |
30 ms |
15604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
16476 KB |
Output is correct |
2 |
Correct |
31 ms |
16460 KB |
Output is correct |
3 |
Execution timed out |
4051 ms |
20700 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
162 ms |
33148 KB |
Output is correct |
2 |
Correct |
142 ms |
33108 KB |
Output is correct |
3 |
Execution timed out |
4019 ms |
55048 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |