| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 803025 |
2023-08-02T19:18:33 Z |
Liudas |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
8956 KB |
#include <bits/stdc++.h>
#include "teams.h"
using namespace std;
vector<pair<int, int>> arr;
vector<bool> taken;
int N;
void init(int K, int A[], int B[]){
N = K;
for(int i = 0; i < N; i ++){
arr.push_back({A[i], B[i]});
}
taken.resize(N);
sort(arr.begin(), arr.end());
sort(arr.begin(), arr.end(), [](pair<int,int> a, pair<int,int>b){return a.second < b.second;});
}
int can(int M, int K[]){
fill(taken.begin(), taken.end(), false);
sort(K, K + M);
for(int i = 0; i < M; i ++){
int need = K[i];
int id = 0;
int got = 0;
while(id < N && got < need){
if(!taken[id] && arr[id].first <= need && arr[id].second >= need){
got++;
taken[id] = true;
}
id++;
}
if(got < need){
return 0;
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 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 |
304 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
304 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
300 KB |
Output is correct |
| 23 |
Correct |
0 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 |
20 ms |
2252 KB |
Output is correct |
| 2 |
Correct |
20 ms |
2124 KB |
Output is correct |
| 3 |
Correct |
20 ms |
2252 KB |
Output is correct |
| 4 |
Correct |
22 ms |
2268 KB |
Output is correct |
| 5 |
Correct |
24 ms |
2252 KB |
Output is correct |
| 6 |
Correct |
20 ms |
2124 KB |
Output is correct |
| 7 |
Correct |
11 ms |
2252 KB |
Output is correct |
| 8 |
Correct |
11 ms |
2252 KB |
Output is correct |
| 9 |
Correct |
1550 ms |
2252 KB |
Output is correct |
| 10 |
Correct |
597 ms |
2252 KB |
Output is correct |
| 11 |
Correct |
71 ms |
2124 KB |
Output is correct |
| 12 |
Correct |
13 ms |
2252 KB |
Output is correct |
| 13 |
Correct |
14 ms |
2124 KB |
Output is correct |
| 14 |
Correct |
14 ms |
2124 KB |
Output is correct |
| 15 |
Correct |
18 ms |
2212 KB |
Output is correct |
| 16 |
Correct |
18 ms |
2156 KB |
Output is correct |
| 17 |
Correct |
12 ms |
2252 KB |
Output is correct |
| 18 |
Correct |
13 ms |
3308 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
65 ms |
2252 KB |
Output is correct |
| 2 |
Correct |
93 ms |
2252 KB |
Output is correct |
| 3 |
Execution timed out |
4051 ms |
2728 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
393 ms |
8900 KB |
Output is correct |
| 2 |
Correct |
460 ms |
8956 KB |
Output is correct |
| 3 |
Execution timed out |
4089 ms |
8384 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
