# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
802789 |
2023-08-02T14:29:23 Z |
happypotato |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
8940 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
int n;
vector<pii> v;
bool cmp(pii &lhs, pii &rhs) {
if (lhs.ss != rhs.ss) return lhs.ss < rhs.ss;
return lhs.ff < rhs.ff;
}
vector<bool> used;
void init(int N, int A[], int B[]) {
n = N;
v.resize(n);
for (int i = 0; i < n; i++) {
v[i] = {A[i], B[i]};
}
sort(v.begin(), v.end(), cmp);
// for (pii &cur : v) cerr << cur.ff << ' ' << cur.ss << endl;
used.resize(n);
}
int can(int M, int K[]) {
for (int i = 0; i < n; i++) used[i] = false;
int m = M;
vector<int> tar(m);
for (int i = 0; i < m; i++) tar[i] = K[i];
sort(tar.begin(), tar.end());
for (int &cur : tar) {
int need = 0;
for (int i = 0; i < n; i++) {
if (used[i]) continue;
if (v[i].ff <= cur && cur <= v[i].ss) {
used[i] = true;
need++;
if (need == cur) break;
}
}
if (need < cur) return false;
}
return true;
}
# |
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 |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
312 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
296 KB |
Output is correct |
11 |
Correct |
1 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 |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 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 |
296 KB |
Output is correct |
24 |
Correct |
0 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 |
15 ms |
1876 KB |
Output is correct |
2 |
Correct |
15 ms |
1876 KB |
Output is correct |
3 |
Correct |
15 ms |
1880 KB |
Output is correct |
4 |
Correct |
18 ms |
2640 KB |
Output is correct |
5 |
Correct |
21 ms |
1876 KB |
Output is correct |
6 |
Correct |
20 ms |
1876 KB |
Output is correct |
7 |
Correct |
11 ms |
1872 KB |
Output is correct |
8 |
Correct |
11 ms |
1876 KB |
Output is correct |
9 |
Correct |
1160 ms |
2132 KB |
Output is correct |
10 |
Correct |
446 ms |
2016 KB |
Output is correct |
11 |
Correct |
52 ms |
1876 KB |
Output is correct |
12 |
Correct |
11 ms |
1876 KB |
Output is correct |
13 |
Correct |
13 ms |
1876 KB |
Output is correct |
14 |
Correct |
12 ms |
1876 KB |
Output is correct |
15 |
Correct |
14 ms |
1884 KB |
Output is correct |
16 |
Correct |
14 ms |
1876 KB |
Output is correct |
17 |
Correct |
11 ms |
1884 KB |
Output is correct |
18 |
Correct |
11 ms |
1784 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
90 ms |
2176 KB |
Output is correct |
2 |
Correct |
105 ms |
2240 KB |
Output is correct |
3 |
Execution timed out |
4061 ms |
2236 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
448 ms |
8940 KB |
Output is correct |
2 |
Correct |
520 ms |
8884 KB |
Output is correct |
3 |
Execution timed out |
4075 ms |
8256 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |