| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 356691 |
2021-01-23T14:10:48 Z |
urd05 |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
11756 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100000];
int b[100000];
typedef pair<int,int> P;
P ind[100000];
int k[100000];
int m;
void init(int N, int A[], int B[]) {
n=N;
for(int i=0;i<n;i++) {
a[i]=A[i];
b[i]=B[i];
ind[i]=P(a[i],i);
}
sort(ind,ind+n);
}
int can(int M, int K[]) {
m=M;
for(int i=0;i<m;i++) {
k[i]=K[i];
}
sort(k,k+m);
int in=0;
priority_queue<int,vector<int>,greater<int>> pq;
for(int i=0;i<m;i++) {
while (in<n&&ind[in].first<=k[i]) {
pq.push(b[ind[in].second]);
in++;
}
for(int j=0;j<k[i];j++) {
while (!pq.empty()&&pq.top()<k[i]) {
pq.pop();
}
if (pq.empty()) {
return 0;
}
pq.pop();
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
512 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
492 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
364 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
364 KB |
Output is correct |
| 16 |
Correct |
1 ms |
364 KB |
Output is correct |
| 17 |
Correct |
1 ms |
364 KB |
Output is correct |
| 18 |
Correct |
1 ms |
364 KB |
Output is correct |
| 19 |
Correct |
1 ms |
364 KB |
Output is correct |
| 20 |
Correct |
1 ms |
364 KB |
Output is correct |
| 21 |
Correct |
1 ms |
364 KB |
Output is correct |
| 22 |
Correct |
1 ms |
364 KB |
Output is correct |
| 23 |
Correct |
1 ms |
364 KB |
Output is correct |
| 24 |
Correct |
1 ms |
364 KB |
Output is correct |
| 25 |
Correct |
1 ms |
364 KB |
Output is correct |
| 26 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
2668 KB |
Output is correct |
| 2 |
Correct |
16 ms |
2668 KB |
Output is correct |
| 3 |
Correct |
29 ms |
3304 KB |
Output is correct |
| 4 |
Correct |
19 ms |
3436 KB |
Output is correct |
| 5 |
Correct |
18 ms |
2668 KB |
Output is correct |
| 6 |
Correct |
20 ms |
2688 KB |
Output is correct |
| 7 |
Correct |
16 ms |
2668 KB |
Output is correct |
| 8 |
Correct |
16 ms |
2668 KB |
Output is correct |
| 9 |
Correct |
14 ms |
3560 KB |
Output is correct |
| 10 |
Correct |
20 ms |
3432 KB |
Output is correct |
| 11 |
Correct |
18 ms |
3304 KB |
Output is correct |
| 12 |
Correct |
14 ms |
3304 KB |
Output is correct |
| 13 |
Correct |
21 ms |
3052 KB |
Output is correct |
| 14 |
Correct |
23 ms |
3304 KB |
Output is correct |
| 15 |
Correct |
17 ms |
2796 KB |
Output is correct |
| 16 |
Correct |
17 ms |
3820 KB |
Output is correct |
| 17 |
Correct |
23 ms |
3948 KB |
Output is correct |
| 18 |
Correct |
23 ms |
3948 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
3052 KB |
Output is correct |
| 2 |
Correct |
23 ms |
3052 KB |
Output is correct |
| 3 |
Execution timed out |
4035 ms |
3760 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
40 ms |
11756 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
