| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1076470 |
2024-08-26T14:10:09 Z |
Pannda |
Gap (APIO16_gap) |
C++17 |
|
41 ms |
1992 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int type, int n) {
constexpr long long C = 1e18;
if (type == 1) {
vector<long long> a(n);
int idx_l = 0, idx_r = n - 1;
long long l = 0, r = C;
for (int t = 0; t < (n + 1) / 2; t++) {
MinMax(l, r, &a[idx_l], &a[idx_r]);
l = a[idx_l] + 1;
r = a[idx_r] - 1;
idx_l++;
idx_r--;
}
long long ans = 0;
for (int i = 0; i + 1 < n; i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
} else {
long long x;
long long last;
MinMax(0, C, &x, &last);
long long ans = 1;
while (last - x > ans) {
// with x, find some d such that [x, x + d] is only x, and [x + d + 1, x + d + 1 + d] is none empty and is (mn, mx)
// update ans with mn - x, and set new x to mx
// jump x until [x + ans] is only x
while (last - x > ans) {
// assert( [x, x + ans] is only x)
long long s = x + ans + 1;
assert(s <= C);
long long mn, mx;
MinMax(s, s + ans, &mn, &mx);
if (mn == -1) {
ans = ans + ans + 1;
} else {
ans = mn - x;
x = mx;
break;
}
}
while (last - x > ans) {
long long mn, mx;
MinMax(x, x + ans, &mn, &mx);
if (mx == x) {
break;
} else {
x = mx;
}
}
}
return ans;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
456 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
8 ms |
716 KB |
Output is correct |
| 17 |
Correct |
7 ms |
1108 KB |
Output is correct |
| 18 |
Correct |
8 ms |
688 KB |
Output is correct |
| 19 |
Correct |
8 ms |
856 KB |
Output is correct |
| 20 |
Correct |
8 ms |
856 KB |
Output is correct |
| 21 |
Correct |
40 ms |
1984 KB |
Output is correct |
| 22 |
Correct |
39 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
26 ms |
1840 KB |
Output is correct |
| 24 |
Correct |
41 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
28 ms |
1892 KB |
Output is correct |
| 26 |
Correct |
28 ms |
1760 KB |
Output is correct |
| 27 |
Correct |
35 ms |
1968 KB |
Output is correct |
| 28 |
Correct |
31 ms |
1828 KB |
Output is correct |
| 29 |
Correct |
33 ms |
1944 KB |
Output is correct |
| 30 |
Correct |
26 ms |
1992 KB |
Output is correct |
| 31 |
Correct |
1 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 2 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
356 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 6 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 9 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
596 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 16 |
Correct |
7 ms |
520 KB |
Output is correct |
| 17 |
Correct |
5 ms |
648 KB |
Output is correct |
| 18 |
Correct |
7 ms |
600 KB |
Output is correct |
| 19 |
Correct |
7 ms |
600 KB |
Output is correct |
| 20 |
Correct |
5 ms |
600 KB |
Output is correct |
| 21 |
Correct |
27 ms |
964 KB |
Output is correct |
| 22 |
Correct |
25 ms |
1112 KB |
Output is correct |
| 23 |
Correct |
29 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
21 ms |
1212 KB |
Output is correct |
| 25 |
Partially correct |
37 ms |
1216 KB |
Partially correct |
| 26 |
Correct |
22 ms |
1112 KB |
Output is correct |
| 27 |
Correct |
27 ms |
1216 KB |
Output is correct |
| 28 |
Correct |
30 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
26 ms |
1208 KB |
Output is correct |
| 30 |
Correct |
20 ms |
1112 KB |
Output is correct |
| 31 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 32 |
Correct |
1 ms |
344 KB |
Output is correct |
