| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 411564 |
2021-05-25T13:54:50 Z |
faresbasbs |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
9388 KB |
#include <bits/stdc++.h>
#include "teams.h"
using namespace std;
vector<pair<int,int>> all;
int n;
void init(int N , int A[] , int B[]){
n = N;
for(int i = 0 ; i < n ; i += 1){
all.push_back({A[i],B[i]});
}
sort(all.rbegin(),all.rend());
}
int can(int m , int k[]){
bool seen[n];
memset(seen,0,sizeof seen);
vector<int> f;
for(int i = 0 ; i < m ; i += 1){
f.push_back(k[i]);
}
sort(f.rbegin(),f.rend());
vector<int> f2 = f;
for(int l = 0 ; l < m ; l += 1){
for(int j = 0 ; j < n ; j += 1){
if(seen[j]){
continue;
}
auto i = all[j];
if(i.first <= f2[l] && i.second >= f2[l]){
seen[j] = 1;
f[l] -= 1;
}
if(f[l] == 0){
break;
}
}
if(f[l] != 0){
return 0;
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 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 |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
288 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 |
1 ms |
204 KB |
Output is correct |
| 23 |
Correct |
2 ms |
204 KB |
Output is correct |
| 24 |
Correct |
1 ms |
288 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 |
2116 KB |
Output is correct |
| 2 |
Correct |
18 ms |
2116 KB |
Output is correct |
| 3 |
Correct |
18 ms |
2244 KB |
Output is correct |
| 4 |
Correct |
21 ms |
3152 KB |
Output is correct |
| 5 |
Correct |
46 ms |
2244 KB |
Output is correct |
| 6 |
Correct |
14 ms |
2244 KB |
Output is correct |
| 7 |
Correct |
46 ms |
2244 KB |
Output is correct |
| 8 |
Correct |
45 ms |
2244 KB |
Output is correct |
| 9 |
Correct |
1841 ms |
2452 KB |
Output is correct |
| 10 |
Correct |
1264 ms |
2756 KB |
Output is correct |
| 11 |
Correct |
154 ms |
2756 KB |
Output is correct |
| 12 |
Correct |
23 ms |
2884 KB |
Output is correct |
| 13 |
Correct |
18 ms |
3140 KB |
Output is correct |
| 14 |
Correct |
17 ms |
3140 KB |
Output is correct |
| 15 |
Correct |
20 ms |
3268 KB |
Output is correct |
| 16 |
Correct |
21 ms |
3268 KB |
Output is correct |
| 17 |
Correct |
18 ms |
3268 KB |
Output is correct |
| 18 |
Correct |
20 ms |
3268 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
95 ms |
2280 KB |
Output is correct |
| 2 |
Correct |
110 ms |
2332 KB |
Output is correct |
| 3 |
Execution timed out |
4034 ms |
2464 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
456 ms |
9388 KB |
Output is correct |
| 2 |
Correct |
540 ms |
9360 KB |
Output is correct |
| 3 |
Execution timed out |
4062 ms |
8732 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
