| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 727226 |
2023-04-20T08:54:37 Z |
vjudge1 |
Teams (IOI15_teams) |
C++11 |
|
4000 ms |
20708 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5;
int n;
int a[MAXN], b[MAXN], ord[MAXN];
void init(int N, int A[], int B[]) {
n = N;
for (int i = 0; i < n; i++) a[i] = A[i], b[i] = B[i];
iota(ord, ord + n, 0);
sort(ord, ord + n, [](int i, int j) {
return a[i] < a[j];
});
}
int can(int M, int K[]) {
priority_queue<int> pq;
int j = 0;
sort(K, K + M);
for (int i = 0; i < M; i++) {
while (j < n && a[ord[j]] <= K[i]) pq.emplace(-b[ord[j++]]);
while (pq.size() && -pq.top() < K[i]) pq.pop();
if (pq.size() < K[i]) return 0;
while (K[i]--) pq.pop();
}
return 1;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:27:31: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
27 | if (pq.size() < K[i]) return 0;
| ~~~~~~~~~~^~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
304 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
320 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
2 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
340 KB |
Output is correct |
| 15 |
Correct |
2 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
2 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
308 KB |
Output is correct |
| 20 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
3376 KB |
Output is correct |
| 2 |
Correct |
15 ms |
3428 KB |
Output is correct |
| 3 |
Correct |
25 ms |
4056 KB |
Output is correct |
| 4 |
Correct |
20 ms |
4016 KB |
Output is correct |
| 5 |
Correct |
14 ms |
3108 KB |
Output is correct |
| 6 |
Correct |
15 ms |
3004 KB |
Output is correct |
| 7 |
Correct |
12 ms |
2984 KB |
Output is correct |
| 8 |
Correct |
11 ms |
2980 KB |
Output is correct |
| 9 |
Correct |
11 ms |
3864 KB |
Output is correct |
| 10 |
Correct |
9 ms |
3468 KB |
Output is correct |
| 11 |
Correct |
9 ms |
3516 KB |
Output is correct |
| 12 |
Correct |
9 ms |
3612 KB |
Output is correct |
| 13 |
Correct |
16 ms |
3532 KB |
Output is correct |
| 14 |
Correct |
16 ms |
3872 KB |
Output is correct |
| 15 |
Correct |
16 ms |
3412 KB |
Output is correct |
| 16 |
Correct |
15 ms |
3408 KB |
Output is correct |
| 17 |
Correct |
15 ms |
3580 KB |
Output is correct |
| 18 |
Correct |
15 ms |
3584 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
4136 KB |
Output is correct |
| 2 |
Correct |
21 ms |
4156 KB |
Output is correct |
| 3 |
Execution timed out |
4041 ms |
4992 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
130 ms |
18256 KB |
Output is correct |
| 2 |
Correct |
104 ms |
18148 KB |
Output is correct |
| 3 |
Execution timed out |
4019 ms |
20708 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
