| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 374745 |
2021-03-08T05:31:12 Z |
ijxjdjd |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
17004 KB |
#include "teams.h"
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
const int MAXN = (int)(1e5);
vector<pair<int, int>> vec;
bool used[MAXN];
int N;
void init(int n, int A[], int B[]) {
N = n;
vec.resize(N);
for (int i = 0; i < N; i++) {
vec[i] = {B[i], A[i]};
}
sort(all(vec));
}
int can(int M, int K[]) {
memset(used, 0, sizeof(used));
vector<int> k(M);
for (int i = 0; i < M; i++) {
k[i] = K[i];
}
sort(all(k));
for (int a : k) {
int temp = a;
for (int i = 0; i < N; i++) {
if (!used[i] && vec[i].second <= a && a <= vec[i].first) {
temp--;
used[i] = true;
if (temp == 0) {
break;
}
}
}
if (temp != 0) {
return 0;
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 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 |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
492 KB |
Output is correct |
| 13 |
Correct |
1 ms |
492 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 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 |
31 ms |
364 KB |
Output is correct |
| 20 |
Correct |
1 ms |
364 KB |
Output is correct |
| 21 |
Correct |
1 ms |
384 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 |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
2668 KB |
Output is correct |
| 2 |
Correct |
17 ms |
2668 KB |
Output is correct |
| 3 |
Correct |
61 ms |
2668 KB |
Output is correct |
| 4 |
Correct |
19 ms |
3436 KB |
Output is correct |
| 5 |
Correct |
22 ms |
2668 KB |
Output is correct |
| 6 |
Correct |
22 ms |
2668 KB |
Output is correct |
| 7 |
Correct |
12 ms |
2668 KB |
Output is correct |
| 8 |
Correct |
12 ms |
2668 KB |
Output is correct |
| 9 |
Correct |
800 ms |
3052 KB |
Output is correct |
| 10 |
Correct |
309 ms |
2796 KB |
Output is correct |
| 11 |
Correct |
38 ms |
2540 KB |
Output is correct |
| 12 |
Correct |
10 ms |
2668 KB |
Output is correct |
| 13 |
Correct |
15 ms |
2668 KB |
Output is correct |
| 14 |
Correct |
15 ms |
2668 KB |
Output is correct |
| 15 |
Correct |
16 ms |
2668 KB |
Output is correct |
| 16 |
Correct |
16 ms |
2668 KB |
Output is correct |
| 17 |
Correct |
13 ms |
2668 KB |
Output is correct |
| 18 |
Correct |
13 ms |
2668 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
74 ms |
2952 KB |
Output is correct |
| 2 |
Correct |
96 ms |
3052 KB |
Output is correct |
| 3 |
Execution timed out |
4078 ms |
3296 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
100 ms |
17004 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
