| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 424891 |
2021-06-12T11:16:13 Z |
ollel |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
13036 KB |
#include <bits/stdc++.h>
#include <iostream>
#include "teams.h"
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define lso(x) x&(-x)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
struct seg {
int a, b;
bool marked = false;
};
vector<seg> s;
int n;
void init(int N, int a[], int b[]) {
n = N;
s.resize(n);
rep(i,0,n) {
s[i].a = a[i];
s[i].b = b[i];
}
sort(s.begin(), s.end(), [](seg x, seg y) {
return x.b < y.b;
});
}
int can(int m, int k[]) {
vi p(m);
rep(i,0,m) p[i] = k[i];
sort(p.begin(), p.end());
rep(i,0,n) s[i].marked = false;
rep(i,0,m) {
int t = p[i], left = p[i];
rep(j, 0, n) {
if((!s[j].marked) && s[j].a <= t && s[j].b >= t) {
left--;
s[j].marked = true;
if (left == 0) break;
}
}
if (left > 0) return 0;
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 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 |
284 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 |
416 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
296 KB |
Output is correct |
| 21 |
Correct |
1 ms |
204 KB |
Output is correct |
| 22 |
Correct |
1 ms |
204 KB |
Output is correct |
| 23 |
Correct |
1 ms |
204 KB |
Output is correct |
| 24 |
Correct |
1 ms |
292 KB |
Output is correct |
| 25 |
Correct |
1 ms |
292 KB |
Output is correct |
| 26 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
3408 KB |
Output is correct |
| 2 |
Correct |
16 ms |
3404 KB |
Output is correct |
| 3 |
Correct |
16 ms |
3412 KB |
Output is correct |
| 4 |
Correct |
18 ms |
4300 KB |
Output is correct |
| 5 |
Correct |
26 ms |
3020 KB |
Output is correct |
| 6 |
Correct |
19 ms |
3036 KB |
Output is correct |
| 7 |
Correct |
13 ms |
2948 KB |
Output is correct |
| 8 |
Correct |
13 ms |
3024 KB |
Output is correct |
| 9 |
Correct |
1628 ms |
3356 KB |
Output is correct |
| 10 |
Correct |
682 ms |
2916 KB |
Output is correct |
| 11 |
Correct |
71 ms |
2848 KB |
Output is correct |
| 12 |
Correct |
14 ms |
2892 KB |
Output is correct |
| 13 |
Correct |
12 ms |
3148 KB |
Output is correct |
| 14 |
Correct |
12 ms |
3148 KB |
Output is correct |
| 15 |
Correct |
16 ms |
3276 KB |
Output is correct |
| 16 |
Correct |
17 ms |
3388 KB |
Output is correct |
| 17 |
Correct |
13 ms |
3276 KB |
Output is correct |
| 18 |
Correct |
13 ms |
3340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
70 ms |
4048 KB |
Output is correct |
| 2 |
Correct |
87 ms |
4188 KB |
Output is correct |
| 3 |
Execution timed out |
4061 ms |
4308 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
365 ms |
13036 KB |
Output is correct |
| 2 |
Correct |
446 ms |
13012 KB |
Output is correct |
| 3 |
Execution timed out |
4082 ms |
12448 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
