#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
pii V[100005];
bool sudah[100005];
bool cmp(pii x,pii y){
return x.second<y.second;
}
int n;
void init(int N, int A[], int B[]) {
for(int i=0;i<N;i++)V[i]=make_pair(A[i],B[i]);
sort(V,V+N,cmp);
n=N;
}
int can(int M, int K[]) {
memset(sudah,false,sizeof(sudah));
sort(K,K+M);
for(int i=0;i<M;i++){
int brp=0;
bool ya=false;
for(int j=0;j<n;j++){
if(!sudah[j] && K[i]>=V[j].first && K[i]<=V[j].second){
brp++;
sudah[j]=true;
}
if(brp==K[i]){
ya=true;
break;
}
}
if(!ya)return 0;
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
420 KB |
Output is correct |
| 3 |
Correct |
3 ms |
504 KB |
Output is correct |
| 4 |
Correct |
3 ms |
376 KB |
Output is correct |
| 5 |
Correct |
3 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
504 KB |
Output is correct |
| 7 |
Correct |
3 ms |
376 KB |
Output is correct |
| 8 |
Correct |
3 ms |
376 KB |
Output is correct |
| 9 |
Correct |
3 ms |
376 KB |
Output is correct |
| 10 |
Correct |
3 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
552 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
3 ms |
472 KB |
Output is correct |
| 18 |
Correct |
3 ms |
376 KB |
Output is correct |
| 19 |
Correct |
3 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
376 KB |
Output is correct |
| 21 |
Correct |
3 ms |
504 KB |
Output is correct |
| 22 |
Correct |
3 ms |
376 KB |
Output is correct |
| 23 |
Correct |
3 ms |
376 KB |
Output is correct |
| 24 |
Correct |
3 ms |
504 KB |
Output is correct |
| 25 |
Correct |
3 ms |
376 KB |
Output is correct |
| 26 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
3104 KB |
Output is correct |
| 2 |
Correct |
21 ms |
3192 KB |
Output is correct |
| 3 |
Correct |
22 ms |
3192 KB |
Output is correct |
| 4 |
Correct |
24 ms |
3704 KB |
Output is correct |
| 5 |
Correct |
30 ms |
2808 KB |
Output is correct |
| 6 |
Correct |
26 ms |
2808 KB |
Output is correct |
| 7 |
Correct |
20 ms |
2716 KB |
Output is correct |
| 8 |
Correct |
17 ms |
2808 KB |
Output is correct |
| 9 |
Correct |
1543 ms |
3016 KB |
Output is correct |
| 10 |
Correct |
584 ms |
2636 KB |
Output is correct |
| 11 |
Correct |
72 ms |
2536 KB |
Output is correct |
| 12 |
Correct |
19 ms |
2680 KB |
Output is correct |
| 13 |
Correct |
16 ms |
2984 KB |
Output is correct |
| 14 |
Correct |
16 ms |
2936 KB |
Output is correct |
| 15 |
Correct |
21 ms |
3192 KB |
Output is correct |
| 16 |
Correct |
20 ms |
3064 KB |
Output is correct |
| 17 |
Correct |
16 ms |
3064 KB |
Output is correct |
| 18 |
Correct |
17 ms |
3136 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
61 ms |
3884 KB |
Output is correct |
| 2 |
Correct |
73 ms |
3960 KB |
Output is correct |
| 3 |
Execution timed out |
4099 ms |
4068 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
41 ms |
16660 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
