| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 384689 |
2021-04-02T05:05:36 Z |
qpwoeirut |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
16468 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> pii;
const int MN = 500005;
int N;
pii A[MN];
void init(int n, int a[], int b[]) {
N = n;
for (int i=0; i<N; ++i) {
A[i] = pii(a[i], b[i]);
}
sort(A, A+N);
}
struct cmps {
inline bool operator()(const pii& a, const pii& b) {
return a.se > b.se || (a.se == b.se && a.fi > b.fi);
}
};
int can(int M, int K[]) {
sort(K, K+M);
int idx = 0;
priority_queue<pii, vector<pii>, cmps> pq;
for (int i=0; i<M; ++i) {
while (idx < N && A[idx].fi <= K[i]) {
pq.push(A[idx]);
++idx;
}
int rem = K[i];
while (rem > 0 && pq.size() > 0) {
if (pq.top().fi <= K[i] && K[i] <= pq.top().se) --rem;
pq.pop();
}
if (rem > 0) return 0;
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
2 ms |
364 KB |
Output is correct |
| 4 |
Correct |
2 ms |
364 KB |
Output is correct |
| 5 |
Correct |
2 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| 11 |
Correct |
2 ms |
364 KB |
Output is correct |
| 12 |
Correct |
2 ms |
364 KB |
Output is correct |
| 13 |
Correct |
2 ms |
388 KB |
Output is correct |
| 14 |
Correct |
2 ms |
364 KB |
Output is correct |
| 15 |
Correct |
2 ms |
364 KB |
Output is correct |
| 16 |
Correct |
2 ms |
364 KB |
Output is correct |
| 17 |
Correct |
1 ms |
364 KB |
Output is correct |
| 18 |
Correct |
1 ms |
364 KB |
Output is correct |
| 19 |
Correct |
1 ms |
364 KB |
Output is correct |
| 20 |
Correct |
1 ms |
364 KB |
Output is correct |
| 21 |
Correct |
1 ms |
364 KB |
Output is correct |
| 22 |
Correct |
1 ms |
364 KB |
Output is correct |
| 23 |
Correct |
1 ms |
364 KB |
Output is correct |
| 24 |
Correct |
1 ms |
364 KB |
Output is correct |
| 25 |
Correct |
1 ms |
364 KB |
Output is correct |
| 26 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
1900 KB |
Output is correct |
| 2 |
Correct |
17 ms |
1900 KB |
Output is correct |
| 3 |
Correct |
35 ms |
3080 KB |
Output is correct |
| 4 |
Correct |
19 ms |
2284 KB |
Output is correct |
| 5 |
Correct |
15 ms |
1900 KB |
Output is correct |
| 6 |
Correct |
17 ms |
1900 KB |
Output is correct |
| 7 |
Correct |
11 ms |
1900 KB |
Output is correct |
| 8 |
Correct |
12 ms |
1900 KB |
Output is correct |
| 9 |
Correct |
14 ms |
3172 KB |
Output is correct |
| 10 |
Correct |
13 ms |
3684 KB |
Output is correct |
| 11 |
Correct |
16 ms |
3684 KB |
Output is correct |
| 12 |
Correct |
15 ms |
3684 KB |
Output is correct |
| 13 |
Correct |
25 ms |
3432 KB |
Output is correct |
| 14 |
Correct |
25 ms |
4068 KB |
Output is correct |
| 15 |
Correct |
17 ms |
3180 KB |
Output is correct |
| 16 |
Correct |
16 ms |
3052 KB |
Output is correct |
| 17 |
Correct |
19 ms |
3308 KB |
Output is correct |
| 18 |
Correct |
20 ms |
3308 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
2284 KB |
Output is correct |
| 2 |
Correct |
22 ms |
2284 KB |
Output is correct |
| 3 |
Execution timed out |
4043 ms |
4144 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
99 ms |
8940 KB |
Output is correct |
| 2 |
Correct |
99 ms |
8940 KB |
Output is correct |
| 3 |
Execution timed out |
4058 ms |
16468 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
