| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 590127 |
2022-07-05T14:39:07 Z |
yutabi |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
13044 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef pair <int,int> ii;
int n;
int* a;
int* b;
void init(int N, int A[], int B[])
{
n=N;
a=A;
b=B;
}
int can(int M, int K[])
{
sort(K,K+M);
vector <ii> s;
for(int i=0;i<n;i++)
{
s.pb(ii(a[i],b[i]));
}
sort(s.begin(),s.end());
int ptr=0;
priority_queue <int> pq;
bool flag=0;
for(int i=0;i<M;i++)
{
while(ptr<n && s[ptr].first<=K[i])
{
pq.push(-s[ptr].second);
ptr++;
}
while(pq.size() && -pq.top()<K[i])
{
pq.pop();
}
for(int j=0;j<K[i];j++)
{
if(pq.empty())
{
flag=1;
break;
}
pq.pop();
}
if(flag)
{
break;
}
}
if(flag)
{
return 0;
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
296 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
296 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 |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
300 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
304 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 |
212 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 |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
296 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
300 KB |
Output is correct |
| 23 |
Correct |
1 ms |
212 KB |
Output is correct |
| 24 |
Correct |
1 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
212 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
2372 KB |
Output is correct |
| 2 |
Correct |
16 ms |
2440 KB |
Output is correct |
| 3 |
Correct |
28 ms |
3000 KB |
Output is correct |
| 4 |
Correct |
19 ms |
2812 KB |
Output is correct |
| 5 |
Correct |
16 ms |
2316 KB |
Output is correct |
| 6 |
Correct |
16 ms |
2948 KB |
Output is correct |
| 7 |
Correct |
14 ms |
3020 KB |
Output is correct |
| 8 |
Correct |
14 ms |
2984 KB |
Output is correct |
| 9 |
Correct |
11 ms |
3612 KB |
Output is correct |
| 10 |
Correct |
9 ms |
3384 KB |
Output is correct |
| 11 |
Correct |
9 ms |
3272 KB |
Output is correct |
| 12 |
Correct |
11 ms |
3348 KB |
Output is correct |
| 13 |
Correct |
17 ms |
3132 KB |
Output is correct |
| 14 |
Correct |
20 ms |
3528 KB |
Output is correct |
| 15 |
Correct |
16 ms |
3000 KB |
Output is correct |
| 16 |
Correct |
15 ms |
2936 KB |
Output is correct |
| 17 |
Correct |
16 ms |
3012 KB |
Output is correct |
| 18 |
Correct |
15 ms |
2992 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2303 ms |
3624 KB |
Output is correct |
| 2 |
Correct |
2656 ms |
3544 KB |
Output is correct |
| 3 |
Execution timed out |
4046 ms |
3388 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4066 ms |
13044 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
