#include "teams.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
vpii S;
void init(int N, int A[], int B[])
{
S.resize(N);
for (int i = 0; i < N; ++i)
S[i] = {A[i], B[i]};
sort(all(S));
}
int can(int M, int K[])
{
sort(K, K + M);
priority_queue<int, vi, greater<int>> pq; // b : end of interval
int idx = 0;
for (int i = 0; i < M; ++i)
{
int todo = K[i];
while (idx < sz(S) && S[idx].first <= K[i])
pq.push(S[idx++].second);
while (todo)
{
if (pq.empty())
return 0;
if (pq.top() >= K[i])
--todo;
pq.pop();
}
}
return 1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
296 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 |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
288 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 |
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 |
300 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
300 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 |
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 |
212 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
3016 KB |
Output is correct |
2 |
Correct |
14 ms |
2936 KB |
Output is correct |
3 |
Correct |
25 ms |
3764 KB |
Output is correct |
4 |
Correct |
17 ms |
3476 KB |
Output is correct |
5 |
Correct |
12 ms |
2644 KB |
Output is correct |
6 |
Correct |
14 ms |
2616 KB |
Output is correct |
7 |
Correct |
10 ms |
2584 KB |
Output is correct |
8 |
Correct |
10 ms |
2640 KB |
Output is correct |
9 |
Correct |
12 ms |
3408 KB |
Output is correct |
10 |
Correct |
8 ms |
3124 KB |
Output is correct |
11 |
Correct |
9 ms |
3024 KB |
Output is correct |
12 |
Correct |
10 ms |
3152 KB |
Output is correct |
13 |
Correct |
16 ms |
3204 KB |
Output is correct |
14 |
Correct |
17 ms |
3380 KB |
Output is correct |
15 |
Correct |
14 ms |
3028 KB |
Output is correct |
16 |
Correct |
14 ms |
3000 KB |
Output is correct |
17 |
Correct |
14 ms |
3120 KB |
Output is correct |
18 |
Correct |
15 ms |
3120 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
3660 KB |
Output is correct |
2 |
Correct |
20 ms |
3776 KB |
Output is correct |
3 |
Execution timed out |
4038 ms |
4584 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
92 ms |
16192 KB |
Output is correct |
2 |
Correct |
89 ms |
16368 KB |
Output is correct |
3 |
Execution timed out |
4030 ms |
19068 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |