| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 419878 |
2021-06-07T14:59:07 Z |
SeDunion |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
27056 KB |
#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
int N;
vector<int>add[(int)5e5+11];
void init(int N_, int A[], int B[]) {
N = N_;
for (int i = 0 ; i < N ; ++ i) add[A[i]].emplace_back(B[i]);
}
priority_queue<int, vector<int>, greater<int>>pq;
int can(int M, int K[]) {
sort(K, K + M);
while (pq.size()) pq.pop();
int L = 0;
for (int i = 0 ; i < M ; ++ i) {
while (L <= K[i]) {
for (int val : add[L]) {
pq.push(val);
}
L++;
}
int mine = K[i];
while (pq.size() && mine) {
int x = pq.top(); pq.pop();
if (x >= K[i]) mine--;
}
if (mine) return 0;
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
11980 KB |
Output is correct |
| 2 |
Correct |
8 ms |
12020 KB |
Output is correct |
| 3 |
Correct |
8 ms |
11932 KB |
Output is correct |
| 4 |
Correct |
8 ms |
12032 KB |
Output is correct |
| 5 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 6 |
Correct |
9 ms |
11980 KB |
Output is correct |
| 7 |
Correct |
9 ms |
11980 KB |
Output is correct |
| 8 |
Correct |
9 ms |
11976 KB |
Output is correct |
| 9 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 10 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 11 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 12 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 13 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 14 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 15 |
Correct |
9 ms |
11980 KB |
Output is correct |
| 16 |
Correct |
9 ms |
12040 KB |
Output is correct |
| 17 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 18 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 19 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 20 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 21 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 22 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 23 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 24 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 25 |
Correct |
8 ms |
11980 KB |
Output is correct |
| 26 |
Correct |
8 ms |
11920 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
14540 KB |
Output is correct |
| 2 |
Correct |
24 ms |
14540 KB |
Output is correct |
| 3 |
Correct |
42 ms |
15168 KB |
Output is correct |
| 4 |
Correct |
34 ms |
15032 KB |
Output is correct |
| 5 |
Correct |
16 ms |
13528 KB |
Output is correct |
| 6 |
Correct |
17 ms |
13548 KB |
Output is correct |
| 7 |
Correct |
14 ms |
13548 KB |
Output is correct |
| 8 |
Correct |
13 ms |
13516 KB |
Output is correct |
| 9 |
Correct |
19 ms |
14080 KB |
Output is correct |
| 10 |
Correct |
17 ms |
14020 KB |
Output is correct |
| 11 |
Correct |
16 ms |
13944 KB |
Output is correct |
| 12 |
Correct |
16 ms |
14020 KB |
Output is correct |
| 13 |
Correct |
22 ms |
13900 KB |
Output is correct |
| 14 |
Correct |
27 ms |
14536 KB |
Output is correct |
| 15 |
Correct |
24 ms |
14540 KB |
Output is correct |
| 16 |
Correct |
22 ms |
14456 KB |
Output is correct |
| 17 |
Correct |
20 ms |
13616 KB |
Output is correct |
| 18 |
Correct |
20 ms |
13556 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
14924 KB |
Output is correct |
| 2 |
Correct |
32 ms |
14924 KB |
Output is correct |
| 3 |
Execution timed out |
4053 ms |
15212 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
169 ms |
25656 KB |
Output is correct |
| 2 |
Correct |
175 ms |
25748 KB |
Output is correct |
| 3 |
Execution timed out |
4059 ms |
27056 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
