| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 744333 |
2023-05-18T12:31:24 Z |
bane |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
19040 KB |
#include "teams.h"
#include "bits/stdc++.h"
using namespace std;
vector<pair<int,int>> intervals;
void init(int N, int A[], int B[])
{
intervals.resize(N);
for (int i = 0; i < N; ++i)
intervals[i] = {A[i], B[i]};
sort(intervals.begin(), intervals.end());
}
int can(int M, int K[])
{
sort(K, K + M);
priority_queue<int, vector<int>, greater<int>> pq; // b : end of interval
int idx = 0;
for (int i = 0; i < M; ++i)
{
int todo = K[i];
while (idx < (int)intervals.size() && intervals[idx].first <= K[i])
pq.push(intervals[idx++].second);
while (todo)
{
if (pq.empty())
return 0;
if (pq.top() >= K[i])
--todo;
pq.pop();
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
300 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 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 |
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 |
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 |
300 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
292 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
296 KB |
Output is correct |
| 23 |
Correct |
1 ms |
300 KB |
Output is correct |
| 24 |
Correct |
1 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 |
2900 KB |
Output is correct |
| 2 |
Correct |
15 ms |
2900 KB |
Output is correct |
| 3 |
Correct |
27 ms |
3532 KB |
Output is correct |
| 4 |
Correct |
20 ms |
3600 KB |
Output is correct |
| 5 |
Correct |
15 ms |
2540 KB |
Output is correct |
| 6 |
Correct |
17 ms |
2644 KB |
Output is correct |
| 7 |
Correct |
11 ms |
2588 KB |
Output is correct |
| 8 |
Correct |
11 ms |
2656 KB |
Output is correct |
| 9 |
Correct |
11 ms |
3400 KB |
Output is correct |
| 10 |
Correct |
9 ms |
3000 KB |
Output is correct |
| 11 |
Correct |
9 ms |
3024 KB |
Output is correct |
| 12 |
Correct |
11 ms |
3152 KB |
Output is correct |
| 13 |
Correct |
20 ms |
3080 KB |
Output is correct |
| 14 |
Correct |
19 ms |
3352 KB |
Output is correct |
| 15 |
Correct |
16 ms |
3064 KB |
Output is correct |
| 16 |
Correct |
15 ms |
3000 KB |
Output is correct |
| 17 |
Correct |
16 ms |
3112 KB |
Output is correct |
| 18 |
Correct |
17 ms |
3120 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
3780 KB |
Output is correct |
| 2 |
Correct |
22 ms |
3660 KB |
Output is correct |
| 3 |
Execution timed out |
4030 ms |
4540 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
92 ms |
16192 KB |
Output is correct |
| 2 |
Correct |
102 ms |
16320 KB |
Output is correct |
| 3 |
Execution timed out |
4026 ms |
19040 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
