#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 5e5 + 5;
vector<int> until[mxN];
int N;
void init(int _N, int A[], int B[])
{
N = _N;
for(int i = 0; i < N; i++) until[A[i]].push_back(B[i]);
}
int can(int M, int K[]) {
sort(K, K + M);
multiset<int> avilable;
for(int i = 0, j = 0; i < M; i++)
{
while(j < N && j <= K[i])
{
for(int x : until[j])
{
avilable.insert(x);
}
j++;
}
int rem = K[i];
while(rem > 0 && !avilable.empty())
{
int me = *avilable.begin();
avilable.erase(avilable.begin());
if(me < K[i]) continue;
rem--;
}
assert(rem >= 0);
if(rem != 0)
{
return 0;
}
}
return 1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
11988 KB |
Output is correct |
2 |
Correct |
7 ms |
11988 KB |
Output is correct |
3 |
Correct |
6 ms |
11988 KB |
Output is correct |
4 |
Correct |
6 ms |
11988 KB |
Output is correct |
5 |
Correct |
7 ms |
11988 KB |
Output is correct |
6 |
Correct |
6 ms |
12060 KB |
Output is correct |
7 |
Correct |
7 ms |
11988 KB |
Output is correct |
8 |
Correct |
7 ms |
11988 KB |
Output is correct |
9 |
Correct |
6 ms |
12024 KB |
Output is correct |
10 |
Correct |
7 ms |
11988 KB |
Output is correct |
11 |
Correct |
7 ms |
12052 KB |
Output is correct |
12 |
Correct |
9 ms |
11988 KB |
Output is correct |
13 |
Correct |
7 ms |
11988 KB |
Output is correct |
14 |
Correct |
7 ms |
11948 KB |
Output is correct |
15 |
Correct |
9 ms |
11988 KB |
Output is correct |
16 |
Correct |
8 ms |
11988 KB |
Output is correct |
17 |
Correct |
9 ms |
11988 KB |
Output is correct |
18 |
Correct |
7 ms |
12048 KB |
Output is correct |
19 |
Correct |
6 ms |
11988 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 |
11988 KB |
Output is correct |
23 |
Correct |
7 ms |
12040 KB |
Output is correct |
24 |
Correct |
8 ms |
12008 KB |
Output is correct |
25 |
Correct |
7 ms |
12048 KB |
Output is correct |
26 |
Correct |
7 ms |
12044 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
14548 KB |
Output is correct |
2 |
Correct |
19 ms |
15768 KB |
Output is correct |
3 |
Correct |
50 ms |
19996 KB |
Output is correct |
4 |
Correct |
27 ms |
16296 KB |
Output is correct |
5 |
Correct |
19 ms |
14292 KB |
Output is correct |
6 |
Correct |
20 ms |
14324 KB |
Output is correct |
7 |
Correct |
14 ms |
14216 KB |
Output is correct |
8 |
Correct |
11 ms |
14292 KB |
Output is correct |
9 |
Correct |
33 ms |
18776 KB |
Output is correct |
10 |
Correct |
31 ms |
18416 KB |
Output is correct |
11 |
Correct |
31 ms |
18476 KB |
Output is correct |
12 |
Correct |
27 ms |
18204 KB |
Output is correct |
13 |
Correct |
33 ms |
17072 KB |
Output is correct |
14 |
Correct |
39 ms |
19448 KB |
Output is correct |
15 |
Correct |
25 ms |
16076 KB |
Output is correct |
16 |
Correct |
21 ms |
15692 KB |
Output is correct |
17 |
Correct |
26 ms |
15752 KB |
Output is correct |
18 |
Correct |
26 ms |
15628 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
15032 KB |
Output is correct |
2 |
Correct |
26 ms |
16516 KB |
Output is correct |
3 |
Execution timed out |
4022 ms |
20708 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
147 ms |
26276 KB |
Output is correct |
2 |
Correct |
138 ms |
33100 KB |
Output is correct |
3 |
Execution timed out |
4100 ms |
55044 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |