| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 419970 |
2021-06-07T20:05:31 Z |
Pbezz |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
28204 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;
const ll MAXN = 5e5+5;
const ll INF = 1e15+7;
vector<pii> stud;
int n;
void init(int N, int A[], int B[]) {
ll i;
pii x;
for(i=0;i<N;i++){
x.first=A[i];
x.second=B[i];
stud.pb(x);
}
sort(stud.begin(),stud.end());
n=N;
}
int can(int M, int K[]) {
sort(K,K+M);
ll i,cur=0,sum=0,p;
pii x;
for(i=0;i<M;i++){
sum+=K[i];
}
if(sum>n)return 0;
priority_queue<pii>children;
for(i=0;i<M;i++){//ver os primeiros que podem ir
while(cur<n && stud[cur].first<=K[i]){
children.push({-stud[cur].second,stud[cur].first});
cur++;
}
//e preciso k[i] crianças validas
p=K[i];
while(p--){
if(children.empty())return 0;
x=children.top();
children.pop();
if((-x.first)<K[i])p++;
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 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 |
288 KB |
Output is correct |
| 8 |
Correct |
1 ms |
288 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
300 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
2 ms |
296 KB |
Output is correct |
| 15 |
Correct |
1 ms |
292 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
296 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 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 |
2 ms |
204 KB |
Output is correct |
| 23 |
Correct |
1 ms |
204 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
3264 KB |
Output is correct |
| 2 |
Correct |
18 ms |
3264 KB |
Output is correct |
| 3 |
Correct |
35 ms |
5728 KB |
Output is correct |
| 4 |
Correct |
20 ms |
3264 KB |
Output is correct |
| 5 |
Correct |
19 ms |
3220 KB |
Output is correct |
| 6 |
Correct |
18 ms |
3264 KB |
Output is correct |
| 7 |
Correct |
14 ms |
3264 KB |
Output is correct |
| 8 |
Correct |
14 ms |
3264 KB |
Output is correct |
| 9 |
Correct |
17 ms |
5820 KB |
Output is correct |
| 10 |
Correct |
16 ms |
5692 KB |
Output is correct |
| 11 |
Correct |
16 ms |
5692 KB |
Output is correct |
| 12 |
Correct |
17 ms |
5620 KB |
Output is correct |
| 13 |
Correct |
26 ms |
4588 KB |
Output is correct |
| 14 |
Correct |
31 ms |
5720 KB |
Output is correct |
| 15 |
Correct |
18 ms |
3264 KB |
Output is correct |
| 16 |
Correct |
18 ms |
3360 KB |
Output is correct |
| 17 |
Correct |
21 ms |
3728 KB |
Output is correct |
| 18 |
Correct |
22 ms |
3616 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
3264 KB |
Output is correct |
| 2 |
Correct |
24 ms |
3168 KB |
Output is correct |
| 3 |
Execution timed out |
4070 ms |
6620 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
115 ms |
12804 KB |
Output is correct |
| 2 |
Correct |
113 ms |
12720 KB |
Output is correct |
| 3 |
Execution timed out |
4098 ms |
28204 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
