| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 134751 |
2019-07-23T08:35:18 Z |
Boxworld |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
12520 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct S{int l,r;}a[500100];
priority_queue<P,vector<P>,greater<P> >Q;
int n;
void init(int N, int A[], int B[]){
n=N;
for (int i=0;i<N;i++)a[i].l=A[i],a[i].r=B[i];
}
int can(int M, int K[]){
while(!Q.empty())Q.pop();
sort(K,K+M);
for (int i=0;i<n;i++){
if (a[i].l<K[0]){
if(K[0]<=a[i].r)Q.push(make_pair(K[0],a[i].r));
}else Q.push(make_pair(a[i].l,a[i].r));
}
for (int i=0;i<M;i++){
if (Q.empty())return 0;
if (Q.size()<K[i])return 0;
for (int j=0;j<K[i];j++){
P x=Q.top();
Q.pop();
if (x.first<=K[i]&&K[i]<=x.second)continue;
else return 0;
}
if (i==M-1)return 1;
if (Q.empty())return 0;
while(Q.top().first<K[i+1]){
P x=Q.top();
Q.pop();
if (K[i+1]<=x.second)Q.push(make_pair(K[i+1],x.second));
if (Q.empty())return 0;
}
}
return 1;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:22:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (Q.size()<K[i])return 0;
~~~~~~~~^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 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 |
376 KB |
Output is correct |
| 7 |
Correct |
3 ms |
376 KB |
Output is correct |
| 8 |
Correct |
1 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
3 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
4 ms |
376 KB |
Output is correct |
| 13 |
Correct |
5 ms |
376 KB |
Output is correct |
| 14 |
Correct |
5 ms |
376 KB |
Output is correct |
| 15 |
Correct |
4 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
376 KB |
Output is correct |
| 18 |
Correct |
2 ms |
376 KB |
Output is correct |
| 19 |
Correct |
2 ms |
376 KB |
Output is correct |
| 20 |
Correct |
2 ms |
376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
376 KB |
Output is correct |
| 22 |
Correct |
2 ms |
376 KB |
Output is correct |
| 23 |
Correct |
2 ms |
376 KB |
Output is correct |
| 24 |
Correct |
2 ms |
376 KB |
Output is correct |
| 25 |
Correct |
2 ms |
380 KB |
Output is correct |
| 26 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
3180 KB |
Output is correct |
| 2 |
Correct |
12 ms |
3204 KB |
Output is correct |
| 3 |
Correct |
11 ms |
2676 KB |
Output is correct |
| 4 |
Correct |
15 ms |
3548 KB |
Output is correct |
| 5 |
Correct |
24 ms |
3180 KB |
Output is correct |
| 6 |
Correct |
24 ms |
3184 KB |
Output is correct |
| 7 |
Correct |
10 ms |
3164 KB |
Output is correct |
| 8 |
Correct |
10 ms |
3180 KB |
Output is correct |
| 9 |
Correct |
23 ms |
3312 KB |
Output is correct |
| 10 |
Correct |
62 ms |
3316 KB |
Output is correct |
| 11 |
Correct |
554 ms |
3184 KB |
Output is correct |
| 12 |
Correct |
826 ms |
3184 KB |
Output is correct |
| 13 |
Correct |
101 ms |
3184 KB |
Output is correct |
| 14 |
Correct |
11 ms |
3184 KB |
Output is correct |
| 15 |
Correct |
16 ms |
3184 KB |
Output is correct |
| 16 |
Correct |
13 ms |
3184 KB |
Output is correct |
| 17 |
Correct |
24 ms |
3184 KB |
Output is correct |
| 18 |
Correct |
29 ms |
3184 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3952 ms |
3380 KB |
Output is correct |
| 2 |
Execution timed out |
4030 ms |
3328 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4003 ms |
12520 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
