#include "teams.h"
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;
multiset<pair<int, int>> students;
void init(int N, int A[], int B[]) {
FOR(i, 0, N) students.insert({B[i], A[i]});
}
int can(int M, int K[]) {
sort(K, K + M);
vector<pair<int, int>> removed;
FOR(i, 0, M) {
vector<pair<int, int>> to_remove;
for (pair<int, int> j : students) {
if (K[i] <= j.first && K[i] >= j.second) to_remove.push_back(j);
if (to_remove.size() == K[i]) break;
}
if (to_remove.size() != K[i]) {
for (pair<int, int> j : removed) students.insert(j);
return 0;
}
for (pair<int, int> j : to_remove) {
students.erase(students.find(j));
removed.push_back(j);
}
}
for (pair<int, int> j : removed) students.insert(j);
return 1;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:19:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (to_remove.size() == K[i]) break;
~~~~~~~~~~~~~~~~~^~~~~~~
teams.cpp:21:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (to_remove.size() != K[i]) {
~~~~~~~~~~~~~~~~~^~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
1 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
4 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
384 KB |
Output is correct |
17 |
Correct |
1 ms |
384 KB |
Output is correct |
18 |
Correct |
1 ms |
256 KB |
Output is correct |
19 |
Correct |
1 ms |
256 KB |
Output is correct |
20 |
Correct |
1 ms |
256 KB |
Output is correct |
21 |
Correct |
1 ms |
256 KB |
Output is correct |
22 |
Correct |
1 ms |
384 KB |
Output is correct |
23 |
Correct |
1 ms |
256 KB |
Output is correct |
24 |
Correct |
1 ms |
256 KB |
Output is correct |
25 |
Correct |
1 ms |
256 KB |
Output is correct |
26 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
6136 KB |
Output is correct |
2 |
Correct |
53 ms |
6136 KB |
Output is correct |
3 |
Correct |
49 ms |
6776 KB |
Output is correct |
4 |
Correct |
61 ms |
6520 KB |
Output is correct |
5 |
Correct |
74 ms |
7284 KB |
Output is correct |
6 |
Correct |
162 ms |
6776 KB |
Output is correct |
7 |
Correct |
61 ms |
6140 KB |
Output is correct |
8 |
Correct |
41 ms |
6136 KB |
Output is correct |
9 |
Correct |
57 ms |
7288 KB |
Output is correct |
10 |
Correct |
65 ms |
7280 KB |
Output is correct |
11 |
Correct |
42 ms |
7280 KB |
Output is correct |
12 |
Correct |
47 ms |
7412 KB |
Output is correct |
13 |
Correct |
71 ms |
7396 KB |
Output is correct |
14 |
Correct |
49 ms |
7284 KB |
Output is correct |
15 |
Correct |
61 ms |
6392 KB |
Output is correct |
16 |
Correct |
48 ms |
6392 KB |
Output is correct |
17 |
Correct |
62 ms |
7704 KB |
Output is correct |
18 |
Correct |
108 ms |
7544 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1353 ms |
6552 KB |
Output is correct |
2 |
Correct |
1829 ms |
6680 KB |
Output is correct |
3 |
Execution timed out |
4043 ms |
7480 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4074 ms |
28192 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |