#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a; i<b; i++)
typedef vector<int>vi;
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define pb push_back
//-------------------------------
const int MX=5e5+10;
int N;
vi vec[MX];
void init(int N, int A[], int B[]) {
::N=N;
FOR(i,0,N) vec[A[i]].pb(B[i]);
}
int can(int M, int K[]) {
vi here(N+1,0);
FOR(i,0,M) here[K[i]]++;
//FOR(i,1,N+1) cout << here[i] << ' '; cout << endl;
multiset<int>s;
FOR(i,1,N+1){
for(int x: vec[i]) s.insert(x);
while(sz(s) && *s.begin()<i) s.erase(s.begin());
FOR(k,0,here[i]){
if(sz(s)<i) return 0;
int rep=i;
while(rep--) s.erase(s.begin());
}
}
return 1;
}
Compilation message
teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:21:15: warning: declaration of 'N' shadows a global declaration [-Wshadow]
21 | void init(int N, int A[], int B[]) {
| ~~~~^
teams.cpp:18:5: note: shadowed declaration is here
18 | int N;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
12012 KB |
Output is correct |
2 |
Correct |
7 ms |
11988 KB |
Output is correct |
3 |
Correct |
7 ms |
12048 KB |
Output is correct |
4 |
Correct |
7 ms |
12044 KB |
Output is correct |
5 |
Correct |
8 ms |
12052 KB |
Output is correct |
6 |
Correct |
7 ms |
12028 KB |
Output is correct |
7 |
Correct |
9 ms |
11988 KB |
Output is correct |
8 |
Correct |
8 ms |
11988 KB |
Output is correct |
9 |
Correct |
6 ms |
11988 KB |
Output is correct |
10 |
Correct |
8 ms |
12048 KB |
Output is correct |
11 |
Correct |
8 ms |
12004 KB |
Output is correct |
12 |
Correct |
9 ms |
12012 KB |
Output is correct |
13 |
Correct |
7 ms |
12060 KB |
Output is correct |
14 |
Correct |
7 ms |
12040 KB |
Output is correct |
15 |
Correct |
8 ms |
12044 KB |
Output is correct |
16 |
Correct |
7 ms |
12040 KB |
Output is correct |
17 |
Correct |
7 ms |
12044 KB |
Output is correct |
18 |
Correct |
9 ms |
11988 KB |
Output is correct |
19 |
Correct |
7 ms |
11988 KB |
Output is correct |
20 |
Correct |
7 ms |
12116 KB |
Output is correct |
21 |
Correct |
8 ms |
11988 KB |
Output is correct |
22 |
Correct |
9 ms |
11988 KB |
Output is correct |
23 |
Correct |
7 ms |
12036 KB |
Output is correct |
24 |
Correct |
7 ms |
11988 KB |
Output is correct |
25 |
Correct |
7 ms |
11988 KB |
Output is correct |
26 |
Correct |
7 ms |
11988 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
16072 KB |
Output is correct |
2 |
Correct |
22 ms |
16212 KB |
Output is correct |
3 |
Correct |
44 ms |
18452 KB |
Output is correct |
4 |
Correct |
21 ms |
16720 KB |
Output is correct |
5 |
Correct |
20 ms |
14676 KB |
Output is correct |
6 |
Correct |
20 ms |
14684 KB |
Output is correct |
7 |
Correct |
13 ms |
14612 KB |
Output is correct |
8 |
Correct |
13 ms |
14608 KB |
Output is correct |
9 |
Correct |
34 ms |
19208 KB |
Output is correct |
10 |
Correct |
31 ms |
18780 KB |
Output is correct |
11 |
Correct |
33 ms |
18820 KB |
Output is correct |
12 |
Correct |
27 ms |
18636 KB |
Output is correct |
13 |
Correct |
29 ms |
17564 KB |
Output is correct |
14 |
Correct |
39 ms |
19608 KB |
Output is correct |
15 |
Correct |
57 ms |
17788 KB |
Output is correct |
16 |
Correct |
19 ms |
15992 KB |
Output is correct |
17 |
Correct |
26 ms |
15828 KB |
Output is correct |
18 |
Correct |
27 ms |
15948 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
16904 KB |
Output is correct |
2 |
Correct |
27 ms |
17300 KB |
Output is correct |
3 |
Execution timed out |
4078 ms |
18756 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
132 ms |
34980 KB |
Output is correct |
2 |
Correct |
145 ms |
36816 KB |
Output is correct |
3 |
Execution timed out |
4013 ms |
45492 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |