| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 619979 |
2022-08-02T18:04:41 Z |
yanndev |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
19120 KB |
#include "teams.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int MX_N = 500042;
int n;
pair<int, int> stud[MX_N];
void init(int N, int A[], int B[]) {
for (int i = 0; i < N; i++)
stud[i] = {A[i], B[i]};
n = N;
sort(stud, stud + N);
}
int can(int M, int K[]) {
sort(K, K + M);
int nxt = 0;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> ranges {};
for (int i = 0; i < M; i++) {
while (nxt < n && stud[nxt].fi <= K[i]) {
ranges.push({stud[nxt].se, stud[nxt].fi});
nxt++;
}
int req = K[i];
while (!ranges.empty() && req) {
auto cur = ranges.top();
ranges.pop();
if (cur.fi >= K[i])
req--;
}
if (req != 0)
return 0;
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 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 |
308 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 |
312 KB |
Output is correct |
| 13 |
Correct |
1 ms |
308 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 |
308 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
304 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 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 |
308 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
3028 KB |
Output is correct |
| 2 |
Correct |
14 ms |
3028 KB |
Output is correct |
| 3 |
Correct |
26 ms |
4124 KB |
Output is correct |
| 4 |
Correct |
16 ms |
3596 KB |
Output is correct |
| 5 |
Correct |
14 ms |
2660 KB |
Output is correct |
| 6 |
Correct |
15 ms |
2780 KB |
Output is correct |
| 7 |
Correct |
10 ms |
2588 KB |
Output is correct |
| 8 |
Correct |
10 ms |
2616 KB |
Output is correct |
| 9 |
Correct |
16 ms |
3984 KB |
Output is correct |
| 10 |
Correct |
15 ms |
3532 KB |
Output is correct |
| 11 |
Correct |
15 ms |
3532 KB |
Output is correct |
| 12 |
Correct |
17 ms |
3692 KB |
Output is correct |
| 13 |
Correct |
22 ms |
3388 KB |
Output is correct |
| 14 |
Correct |
21 ms |
3896 KB |
Output is correct |
| 15 |
Correct |
15 ms |
3156 KB |
Output is correct |
| 16 |
Correct |
13 ms |
2948 KB |
Output is correct |
| 17 |
Correct |
18 ms |
3276 KB |
Output is correct |
| 18 |
Correct |
17 ms |
3284 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
3740 KB |
Output is correct |
| 2 |
Correct |
21 ms |
3788 KB |
Output is correct |
| 3 |
Execution timed out |
4061 ms |
5272 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
95 ms |
11668 KB |
Output is correct |
| 2 |
Correct |
95 ms |
11720 KB |
Output is correct |
| 3 |
Execution timed out |
4074 ms |
19120 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
