#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
inline int IN_RANGE(int x, pair<int, int> p) { return p.first <= x and x <= p.second; }
vector<pair<int, int>> students;
void init(int N, int L[], int R[]) {
students.resize(N);
for (int i = 0; i < N; i++)
students[i] = make_pair(L[i], R[i]);
sort(students.begin(), students.end());
}
int can(int M, int K[]) {
vector<int> groups(K, K + M);
sort(groups.begin(), groups.end());
priority_queue<int, vector<int>, greater<int>> rights;
auto it = students.begin();
for (int g : groups) {
while (it != students.end() and it->first <= g) {
rights.push(it->second);
it++;
}
for (int cnt = g; cnt > 0; ) {
if (rights.empty())
return false;
if (rights.top() >= g)
cnt--;
rights.pop();
}
}
return true;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
308 KB |
Output is correct |
| 6 |
Correct |
1 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
304 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 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 |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
300 KB |
Output is correct |
| 21 |
Correct |
0 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
212 KB |
Output is correct |
| 23 |
Correct |
1 ms |
212 KB |
Output is correct |
| 24 |
Correct |
1 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
296 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
14 ms |
1880 KB |
Output is correct |
| 2 |
Correct |
14 ms |
1876 KB |
Output is correct |
| 3 |
Correct |
25 ms |
2512 KB |
Output is correct |
| 4 |
Correct |
20 ms |
2644 KB |
Output is correct |
| 5 |
Correct |
12 ms |
1876 KB |
Output is correct |
| 6 |
Correct |
13 ms |
1880 KB |
Output is correct |
| 7 |
Correct |
12 ms |
1876 KB |
Output is correct |
| 8 |
Correct |
10 ms |
1876 KB |
Output is correct |
| 9 |
Correct |
9 ms |
2768 KB |
Output is correct |
| 10 |
Correct |
8 ms |
2640 KB |
Output is correct |
| 11 |
Correct |
8 ms |
2512 KB |
Output is correct |
| 12 |
Correct |
9 ms |
2512 KB |
Output is correct |
| 13 |
Correct |
16 ms |
2256 KB |
Output is correct |
| 14 |
Correct |
17 ms |
2508 KB |
Output is correct |
| 15 |
Correct |
15 ms |
1876 KB |
Output is correct |
| 16 |
Correct |
15 ms |
3004 KB |
Output is correct |
| 17 |
Correct |
14 ms |
3132 KB |
Output is correct |
| 18 |
Correct |
14 ms |
3084 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
19 ms |
2260 KB |
Output is correct |
| 2 |
Correct |
19 ms |
2260 KB |
Output is correct |
| 3 |
Execution timed out |
4038 ms |
3044 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
85 ms |
8888 KB |
Output is correct |
| 2 |
Correct |
87 ms |
8804 KB |
Output is correct |
| 3 |
Execution timed out |
4042 ms |
12368 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
