| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 838563 |
2023-08-27T11:42:08 Z |
tch1cherin |
Gap (APIO16_gap) |
C++17 |
|
54 ms |
3060 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int T, int N) {
if (T == 1) {
long long Min = -1, Max = 1e18l + 1;
vector<long long> front, back;
for (int i = 0; i < (N + 1) / 2; i++) {
MinMax(Min + 1, Max - 1, &Min, &Max);
if (Min != Max) {
front.push_back(Min);
}
back.push_back(Max);
}
reverse(back.begin(), back.end());
vector<long long> A;
for (auto v : front) {
A.push_back(v);
}
for (auto v : back) {
A.push_back(v);
}
long long gap = 0;
for (int i = 0; i < N - 1; i++) {
gap = max(gap, A[i + 1] - A[i]);
}
return gap;
} else {
long long Min, Max;
MinMax(0, 1e18, &Min, &Max);
queue<pair<long long, long long>> Q;
Q.push({Min, Max});
long long maxConfirmed = (Max - Min + N - 2) / (N - 1);
uniform_real_distribution<long double> dist(0, 1);
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
while (!Q.empty()) {
auto [l, r] = Q.front();
Q.pop();
if (r - l <= maxConfirmed) {
continue;
}
long long mid = l + (r - l) / 2;
long long Minl = -1, Maxl = -1, Minr = -1, Maxr = -1;
if (l <= mid) {
MinMax(l, mid, &Minl, &Maxl);
if (Minl != -1) {
Q.push({Minl, Maxl});
}
}
if (mid + 1 <= r && (r - mid - 1 > maxConfirmed || (Maxl != -1 && r - Maxl > maxConfirmed))) {
MinMax(mid + 1, r, &Minr, &Maxr);
if (Minr != -1) {
Q.push({Minr, Maxr});
}
}
if (Maxl != -1 && Minr != -1) {
maxConfirmed = max(maxConfirmed, Minr - Maxl);
}
}
return maxConfirmed;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
7 ms |
1104 KB |
Output is correct |
| 17 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 18 |
Correct |
8 ms |
1168 KB |
Output is correct |
| 19 |
Correct |
7 ms |
1168 KB |
Output is correct |
| 20 |
Correct |
7 ms |
1168 KB |
Output is correct |
| 21 |
Correct |
29 ms |
2928 KB |
Output is correct |
| 22 |
Correct |
29 ms |
3044 KB |
Output is correct |
| 23 |
Correct |
30 ms |
3052 KB |
Output is correct |
| 24 |
Correct |
31 ms |
3060 KB |
Output is correct |
| 25 |
Correct |
27 ms |
2956 KB |
Output is correct |
| 26 |
Correct |
30 ms |
3060 KB |
Output is correct |
| 27 |
Correct |
29 ms |
2924 KB |
Output is correct |
| 28 |
Correct |
33 ms |
2976 KB |
Output is correct |
| 29 |
Correct |
31 ms |
2952 KB |
Output is correct |
| 30 |
Correct |
24 ms |
3012 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
1 ms |
208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
208 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
460 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
208 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
336 KB |
Partially correct |
| 16 |
Partially correct |
6 ms |
472 KB |
Partially correct |
| 17 |
Partially correct |
6 ms |
464 KB |
Partially correct |
| 18 |
Partially correct |
6 ms |
464 KB |
Partially correct |
| 19 |
Partially correct |
5 ms |
464 KB |
Partially correct |
| 20 |
Partially correct |
2 ms |
464 KB |
Partially correct |
| 21 |
Partially correct |
20 ms |
1108 KB |
Partially correct |
| 22 |
Partially correct |
21 ms |
1164 KB |
Partially correct |
| 23 |
Partially correct |
27 ms |
1144 KB |
Partially correct |
| 24 |
Partially correct |
20 ms |
1072 KB |
Partially correct |
| 25 |
Partially correct |
54 ms |
1608 KB |
Partially correct |
| 26 |
Partially correct |
22 ms |
1108 KB |
Partially correct |
| 27 |
Partially correct |
22 ms |
1136 KB |
Partially correct |
| 28 |
Partially correct |
22 ms |
1232 KB |
Partially correct |
| 29 |
Partially correct |
20 ms |
1104 KB |
Partially correct |
| 30 |
Partially correct |
7 ms |
1104 KB |
Partially correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
