# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727679 | 2023-04-21T05:53:13 Z | mgl_diamond | Teams (IOI15_teams) | C++14 | 4000 ms | 9944 KB |
#include <bits/stdc++.h> #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() #define C make_pair #define vec vector #define ins push_back #define fi first #define se second using namespace std; using ll = long long; using ii = pair<int, int>; const int N = 1e5+5; int n; ii guy[N]; void init(int N, int A[], int B[]) { n = N; for(int i=0; i<n; ++i) guy[i] = {A[i], B[i]}; sort(guy, guy+n); } bool can(int M, int K[]) { priority_queue<int> pq; sort(K, K+M); for(int i=0, j=0; i<M; ++i) { while (j<n && guy[j].fi <= K[i]) pq.push(-guy[j++].se); while (!pq.empty() && -pq.top() < K[i]) pq.pop(); while (K[i]--) { if (pq.empty()) return 0; pq.pop(); } } return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 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 | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 1 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 212 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 | 212 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 0 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 | 0 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 | 13 ms | 1860 KB | Output is correct |
2 | Correct | 13 ms | 1880 KB | Output is correct |
3 | Correct | 24 ms | 2512 KB | Output is correct |
4 | Correct | 15 ms | 2260 KB | Output is correct |
5 | Correct | 11 ms | 1880 KB | Output is correct |
6 | Correct | 13 ms | 1880 KB | Output is correct |
7 | Correct | 11 ms | 1820 KB | Output is correct |
8 | Correct | 10 ms | 1876 KB | Output is correct |
9 | Correct | 9 ms | 2640 KB | Output is correct |
10 | Correct | 8 ms | 3036 KB | Output is correct |
11 | Correct | 9 ms | 3024 KB | Output is correct |
12 | Correct | 9 ms | 3152 KB | Output is correct |
13 | Correct | 16 ms | 3136 KB | Output is correct |
14 | Correct | 17 ms | 3472 KB | Output is correct |
15 | Correct | 14 ms | 2996 KB | Output is correct |
16 | Correct | 15 ms | 3008 KB | Output is correct |
17 | Correct | 14 ms | 3188 KB | Output is correct |
18 | Correct | 15 ms | 3148 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 2240 KB | Output is correct |
2 | Correct | 20 ms | 2256 KB | Output is correct |
3 | Execution timed out | 4072 ms | 3040 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 32 ms | 9944 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |