| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 956188 |
2024-04-01T09:23:31 Z |
thinknoexit |
Gap (APIO16_gap) |
C++17 |
|
36 ms |
2164 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
ll a[100100];
int n;
ll ans = 1;
void play(ll l, ll r) {
if (r - l <= ans) return;
ll mid = (l + r) / 2;
ll ql = -1, qr = -1, _l = -1, _r = -1;
if (l + 1 <= mid) MinMax(l + 1, mid, &_l, &ql);
if (mid + 1 <= r - 1) MinMax(mid + 1, r - 1, &qr, &_r);
if (ql == -1 && qr == -1) return;
if (ql == -1) {
ans = max(ans, r - _r);
return play(qr, _r);
}
if (qr == -1) {
ans = max(ans, _l - l);
return play(_l, ql);
}
if (ql != -1 && qr != -1) {
ans = max(ans, r - _r);
ans = max(ans, _l - l);
ans = max(ans, qr - ql);
play(_l, ql), play(qr, _r);
}
}
ll findGap(int T, int N) {
n = N;
if (T == 1) {
a[0] = -1, a[n + 1] = inf + 1;
for (int i = 1;i <= n / 2;i++) {
MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
}
if (n & 1) {
ll _;
MinMax(a[n / 2] + 1, a[n / 2 + 2] - 1, &a[n / 2 + 1], &_);
}
for (int i = 1;i < n;i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
}
ll mn, mx;
MinMax(0, inf, &mn, &mx);
play(mn, mx);
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 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 |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 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 |
844 KB |
Output is correct |
| 17 |
Correct |
8 ms |
648 KB |
Output is correct |
| 18 |
Correct |
8 ms |
648 KB |
Output is correct |
| 19 |
Correct |
7 ms |
624 KB |
Output is correct |
| 20 |
Correct |
6 ms |
828 KB |
Output is correct |
| 21 |
Correct |
32 ms |
2148 KB |
Output is correct |
| 22 |
Correct |
28 ms |
1984 KB |
Output is correct |
| 23 |
Correct |
28 ms |
1980 KB |
Output is correct |
| 24 |
Correct |
35 ms |
1744 KB |
Output is correct |
| 25 |
Correct |
26 ms |
1952 KB |
Output is correct |
| 26 |
Correct |
28 ms |
1980 KB |
Output is correct |
| 27 |
Correct |
28 ms |
2164 KB |
Output is correct |
| 28 |
Correct |
28 ms |
2000 KB |
Output is correct |
| 29 |
Correct |
36 ms |
1776 KB |
Output is correct |
| 30 |
Correct |
29 ms |
1976 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Correct |
0 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 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 7 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 9 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 16 |
Partially correct |
6 ms |
892 KB |
Partially correct |
| 17 |
Partially correct |
6 ms |
644 KB |
Partially correct |
| 18 |
Partially correct |
6 ms |
644 KB |
Partially correct |
| 19 |
Partially correct |
6 ms |
644 KB |
Partially correct |
| 20 |
Correct |
2 ms |
600 KB |
Output is correct |
| 21 |
Partially correct |
20 ms |
1220 KB |
Partially correct |
| 22 |
Partially correct |
21 ms |
1212 KB |
Partially correct |
| 23 |
Partially correct |
20 ms |
1228 KB |
Partially correct |
| 24 |
Partially correct |
22 ms |
1228 KB |
Partially correct |
| 25 |
Partially correct |
33 ms |
1196 KB |
Partially correct |
| 26 |
Partially correct |
23 ms |
1052 KB |
Partially correct |
| 27 |
Partially correct |
21 ms |
1380 KB |
Partially correct |
| 28 |
Partially correct |
22 ms |
1328 KB |
Partially correct |
| 29 |
Partially correct |
21 ms |
1212 KB |
Partially correct |
| 30 |
Correct |
7 ms |
1212 KB |
Output is correct |
| 31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
