#include<bits/stdc++.h>
#include "teams.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
//init(N, A, B) — The grader will call this function first and exactly once.
//can(M, K) — After calling init once, the grader will call this function times in a row, once for each day.
vii v;
int n;
void init(int x, int a[], int b[]){
n=x;
v=vii(n);
for (int i=0;i<n;i++){
v[i]=pii{a[i],b[i]};
}
sort(v.begin(),v.end());
}
int can(int m, int k[]){
vi q(m);
for (int i=0;i<m;i++) q[i]=k[i];
sort(q.begin(),q.end());
priority_queue<int> cola;
int i=0;
for (int s:q){
while (i<n and v[i].first<=s){
cola.push(-v[i].second);
i++;
}
while (cola.size() and -cola.top()<s) cola.pop();
if (cola.size()>=s){
while (s--) cola.pop();
}
else return 0;
}
return 1;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:38:24: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
38 | if (cola.size()>=s){
| ~~~~~~~~~~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
208 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
304 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
204 KB |
Output is correct |
23 |
Correct |
1 ms |
292 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Correct |
1 ms |
204 KB |
Output is correct |
26 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
1868 KB |
Output is correct |
2 |
Correct |
16 ms |
1872 KB |
Output is correct |
3 |
Correct |
24 ms |
2480 KB |
Output is correct |
4 |
Correct |
23 ms |
2636 KB |
Output is correct |
5 |
Correct |
13 ms |
1868 KB |
Output is correct |
6 |
Correct |
15 ms |
1868 KB |
Output is correct |
7 |
Correct |
12 ms |
1868 KB |
Output is correct |
8 |
Correct |
11 ms |
1868 KB |
Output is correct |
9 |
Correct |
15 ms |
2760 KB |
Output is correct |
10 |
Correct |
14 ms |
2628 KB |
Output is correct |
11 |
Correct |
9 ms |
2436 KB |
Output is correct |
12 |
Correct |
12 ms |
2504 KB |
Output is correct |
13 |
Correct |
18 ms |
2256 KB |
Output is correct |
14 |
Correct |
21 ms |
2512 KB |
Output is correct |
15 |
Correct |
16 ms |
1908 KB |
Output is correct |
16 |
Correct |
17 ms |
1868 KB |
Output is correct |
17 |
Correct |
16 ms |
2000 KB |
Output is correct |
18 |
Correct |
20 ms |
2000 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
2256 KB |
Output is correct |
2 |
Correct |
23 ms |
2260 KB |
Output is correct |
3 |
Execution timed out |
4042 ms |
2888 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
100 ms |
8900 KB |
Output is correct |
2 |
Correct |
102 ms |
8888 KB |
Output is correct |
3 |
Execution timed out |
4062 ms |
12212 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |