#include <bits/stdc++.h>
#include<teams.h>
using namespace std;
int n;
int a[100001],b[100001];
void init(int N, int A[], int B[]) {
n=N;
vector<pair<int,int> >v;
for(int i=0;i<N;i++){
v.push_back({A[i],B[i]});
}
sort(v.begin(),v.end());
for(int i=0;i<N;i++){
a[i]=v[i].first;
b[i]=v[i].second;
}
}
int can(int M, int K[]) {
priority_queue<int,vector<int>,greater<int> >pq;
sort(K,K+M);
//cout<<pq.top()<<endl;
int j=0;
for(int i=0;i<M;i++){
while(!pq.empty() and pq.top()<K[i]){
pq.pop();
}
while(j<n){
if(K[i]>=a[j] and K[i]<=b[j]){
pq.push(b[j]);
}else if(K[i]<a[j]){
break;
}
j++;
}
int t1=0;
if(pq.size()<K[i]){
//cout<<i<<endl;
return 0;
}else{
for(int k1=0;k1<K[i];k1++){
pq.pop();
}
}
}
return 1;
}
/*
int main()
{
int n1;
cin>>n1;
int a1[n1],b1[n1];
for(int i=0;i<n1;i++){
cin>>a1[i]>>b1[i];
}
init(n1,a1,b1);
int q;
cin>>q;
for(int i=0;i<q;i++){
int m;
cin>>m;
int k[m];
for(int j=0;j<m;j++){
cin>>k[j];
}
cout<<can(m,k)<<endl;
}
}
*/
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:39:21: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
39 | if(pq.size()<K[i]){
| ~~~~~~~~~^~~~~
teams.cpp:38:13: warning: unused variable 't1' [-Wunused-variable]
38 | int t1=0;
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
312 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
320 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
312 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
22 |
Correct |
1 ms |
212 KB |
Output is correct |
23 |
Correct |
1 ms |
308 KB |
Output is correct |
24 |
Correct |
1 ms |
308 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
2792 KB |
Output is correct |
2 |
Correct |
18 ms |
2760 KB |
Output is correct |
3 |
Correct |
20 ms |
2784 KB |
Output is correct |
4 |
Correct |
17 ms |
2760 KB |
Output is correct |
5 |
Correct |
12 ms |
2788 KB |
Output is correct |
6 |
Correct |
12 ms |
3528 KB |
Output is correct |
7 |
Correct |
11 ms |
3500 KB |
Output is correct |
8 |
Correct |
13 ms |
3528 KB |
Output is correct |
9 |
Correct |
11 ms |
3768 KB |
Output is correct |
10 |
Correct |
10 ms |
3328 KB |
Output is correct |
11 |
Correct |
10 ms |
3312 KB |
Output is correct |
12 |
Correct |
10 ms |
3384 KB |
Output is correct |
13 |
Correct |
17 ms |
3708 KB |
Output is correct |
14 |
Correct |
17 ms |
3756 KB |
Output is correct |
15 |
Correct |
18 ms |
3876 KB |
Output is correct |
16 |
Correct |
17 ms |
3796 KB |
Output is correct |
17 |
Correct |
16 ms |
3784 KB |
Output is correct |
18 |
Correct |
19 ms |
3816 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
2760 KB |
Output is correct |
2 |
Correct |
20 ms |
2788 KB |
Output is correct |
3 |
Execution timed out |
4046 ms |
2788 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
96 ms |
18132 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |