| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 186269 |
2020-01-12T06:41:16 Z |
TAISA_ |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
16228 KB |
#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
vector<P> v;
int n;
void init(int N, int A[], int B[]) {
for(int i=0;i<N;i++){
v.emplace_back(A[i],B[i]);
}
n=N;
sort(v.begin(),v.end());
}
int can(int M, int K[]) {
sort(K,K+M);
int id=0;
priority_queue<P,vector<P>,greater<P>> q;
for(int i=0;i<M;i++){
while(id<n&&v[id].first<=K[i]){
q.push(P(v[id].second,v[id].first));
id++;
}
int cnt=K[i];
while(!q.empty()&&cnt>0){
if(q.top().first<K[i]){
q.pop();
continue;
}
cnt--;
q.pop();
}
if(cnt>0){
return 0;
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
256 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
252 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
256 KB |
Output is correct |
| 10 |
Correct |
3 ms |
380 KB |
Output is correct |
| 11 |
Correct |
6 ms |
376 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
384 KB |
Output is correct |
| 14 |
Correct |
3 ms |
256 KB |
Output is correct |
| 15 |
Correct |
3 ms |
256 KB |
Output is correct |
| 16 |
Correct |
3 ms |
256 KB |
Output is correct |
| 17 |
Correct |
2 ms |
376 KB |
Output is correct |
| 18 |
Correct |
2 ms |
376 KB |
Output is correct |
| 19 |
Correct |
0 ms |
256 KB |
Output is correct |
| 20 |
Correct |
2 ms |
256 KB |
Output is correct |
| 21 |
Correct |
2 ms |
256 KB |
Output is correct |
| 22 |
Correct |
2 ms |
256 KB |
Output is correct |
| 23 |
Correct |
2 ms |
256 KB |
Output is correct |
| 24 |
Correct |
2 ms |
256 KB |
Output is correct |
| 25 |
Correct |
2 ms |
256 KB |
Output is correct |
| 26 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
2260 KB |
Output is correct |
| 2 |
Correct |
19 ms |
2288 KB |
Output is correct |
| 3 |
Correct |
36 ms |
3440 KB |
Output is correct |
| 4 |
Correct |
21 ms |
2288 KB |
Output is correct |
| 5 |
Correct |
18 ms |
2328 KB |
Output is correct |
| 6 |
Correct |
20 ms |
2288 KB |
Output is correct |
| 7 |
Correct |
16 ms |
2288 KB |
Output is correct |
| 8 |
Correct |
15 ms |
2288 KB |
Output is correct |
| 9 |
Correct |
18 ms |
3564 KB |
Output is correct |
| 10 |
Correct |
17 ms |
4076 KB |
Output is correct |
| 11 |
Correct |
16 ms |
4076 KB |
Output is correct |
| 12 |
Correct |
19 ms |
4204 KB |
Output is correct |
| 13 |
Correct |
31 ms |
3692 KB |
Output is correct |
| 14 |
Correct |
30 ms |
4460 KB |
Output is correct |
| 15 |
Correct |
20 ms |
3412 KB |
Output is correct |
| 16 |
Correct |
19 ms |
3440 KB |
Output is correct |
| 17 |
Correct |
22 ms |
3436 KB |
Output is correct |
| 18 |
Correct |
25 ms |
3480 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
2372 KB |
Output is correct |
| 2 |
Correct |
28 ms |
2328 KB |
Output is correct |
| 3 |
Execution timed out |
4024 ms |
3944 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
108 ms |
8984 KB |
Output is correct |
| 2 |
Correct |
109 ms |
8976 KB |
Output is correct |
| 3 |
Execution timed out |
4070 ms |
16228 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
