| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 73034 |
2018-08-27T14:04:36 Z |
MKopchev |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
20588 KB |
#include<bits/stdc++.h>
#include "teams.h"
using namespace std;
int n;
vector< pair<int,int> > inp;
void init(int N,int A[],int B[])
{
n=N;
for(int i=0;i<N;i++)
inp.push_back({A[i],B[i]});
sort(inp.begin(),inp.end());
}
priority_queue<int> q,idle;
int can(int m,int k[])
{
q=idle;
sort(k,k+m);
int pos=0;
for(int i=0;i<m;i++)
{
int p=k[i];
while(pos<n&&
inp[pos].first<=p)
{q.push(-inp[pos].second);pos++;}
while(q.size()&&-q.top()<p)q.pop();
//cout<<p<<" -> "<<q.size()<<endl;
if(q.size()<p)return 0;
for(int j=1;j<=p;j++)
q.pop();
}
return 1;
}
/*
int main()
{
init(4,[1,2,2,2],[2,3,3,4]);
cout<<call(2,[1,3])<<endl;
cout<<call(2,[1,1])<<endl;
}
*/
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:27:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(q.size()<p)return 0;
~~~~~~~~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
492 KB |
Output is correct |
| 3 |
Correct |
3 ms |
492 KB |
Output is correct |
| 4 |
Correct |
2 ms |
492 KB |
Output is correct |
| 5 |
Correct |
3 ms |
604 KB |
Output is correct |
| 6 |
Correct |
2 ms |
604 KB |
Output is correct |
| 7 |
Correct |
3 ms |
604 KB |
Output is correct |
| 8 |
Correct |
3 ms |
604 KB |
Output is correct |
| 9 |
Correct |
2 ms |
612 KB |
Output is correct |
| 10 |
Correct |
3 ms |
620 KB |
Output is correct |
| 11 |
Correct |
2 ms |
620 KB |
Output is correct |
| 12 |
Correct |
3 ms |
620 KB |
Output is correct |
| 13 |
Correct |
3 ms |
620 KB |
Output is correct |
| 14 |
Correct |
3 ms |
620 KB |
Output is correct |
| 15 |
Correct |
2 ms |
620 KB |
Output is correct |
| 16 |
Correct |
2 ms |
620 KB |
Output is correct |
| 17 |
Correct |
2 ms |
620 KB |
Output is correct |
| 18 |
Correct |
2 ms |
620 KB |
Output is correct |
| 19 |
Correct |
2 ms |
620 KB |
Output is correct |
| 20 |
Correct |
3 ms |
620 KB |
Output is correct |
| 21 |
Correct |
2 ms |
620 KB |
Output is correct |
| 22 |
Correct |
2 ms |
620 KB |
Output is correct |
| 23 |
Correct |
3 ms |
620 KB |
Output is correct |
| 24 |
Correct |
2 ms |
644 KB |
Output is correct |
| 25 |
Correct |
2 ms |
644 KB |
Output is correct |
| 26 |
Correct |
2 ms |
644 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
2556 KB |
Output is correct |
| 2 |
Correct |
19 ms |
2556 KB |
Output is correct |
| 3 |
Correct |
32 ms |
3064 KB |
Output is correct |
| 4 |
Correct |
22 ms |
3064 KB |
Output is correct |
| 5 |
Correct |
19 ms |
3064 KB |
Output is correct |
| 6 |
Correct |
21 ms |
3064 KB |
Output is correct |
| 7 |
Correct |
16 ms |
3064 KB |
Output is correct |
| 8 |
Correct |
16 ms |
3064 KB |
Output is correct |
| 9 |
Correct |
15 ms |
3192 KB |
Output is correct |
| 10 |
Correct |
17 ms |
3192 KB |
Output is correct |
| 11 |
Correct |
16 ms |
3192 KB |
Output is correct |
| 12 |
Correct |
14 ms |
3192 KB |
Output is correct |
| 13 |
Correct |
21 ms |
3192 KB |
Output is correct |
| 14 |
Correct |
24 ms |
3192 KB |
Output is correct |
| 15 |
Correct |
19 ms |
3192 KB |
Output is correct |
| 16 |
Correct |
18 ms |
3192 KB |
Output is correct |
| 17 |
Correct |
20 ms |
3192 KB |
Output is correct |
| 18 |
Correct |
20 ms |
3192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
3192 KB |
Output is correct |
| 2 |
Correct |
25 ms |
3192 KB |
Output is correct |
| 3 |
Execution timed out |
4030 ms |
4524 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
125 ms |
10604 KB |
Output is correct |
| 2 |
Correct |
111 ms |
10644 KB |
Output is correct |
| 3 |
Execution timed out |
4027 ms |
20588 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
