#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll ans[100005];
long long findGap(int T, int N) {
if (T == 1) {
ll l = 0, r = 2e18;
int lidx = 0, ridx = N - 1;
ll mn, mx;
for (int i = 0; i < (N + 1) / 2; i++) {
MinMax(l, r, &mn, &mx);
ans[lidx++] = mn, ans[ridx--] = mx;
l = mn + 1, r = mx - 1;
}
ll ret = 0;
for (int i = 1; i < N; i++) ret = max(ret, ans[i] - ans[i - 1]);
return ret;
}
if (T == 2) {
ll l = 0, r = 1e18 + 500;
ll mn, mx;
MinMax(l, r, &mn, &mx);
l = mn, r = mx;
ll len = (r - 1) - (l + 1) + 1;
if (N == 2) return r - l;
ll b = len / N;
if (len % N) b++;
ll ret = 0;
ll p = l;
l++;
while (l < r) {
MinMax(l, l + b, &mn, &mx);
l += b + 1;
if (mn == -1 && mx == -1) continue;
ret = max(ret, mn - p);
ret = max(ret, mx - mn);
p = mx;
}
return ret;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
61 | }
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 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 |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 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 |
6 ms |
600 KB |
Output is correct |
| 17 |
Correct |
6 ms |
600 KB |
Output is correct |
| 18 |
Correct |
7 ms |
852 KB |
Output is correct |
| 19 |
Correct |
7 ms |
600 KB |
Output is correct |
| 20 |
Correct |
8 ms |
600 KB |
Output is correct |
| 21 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 22 |
Correct |
28 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
31 ms |
1872 KB |
Output is correct |
| 25 |
Correct |
23 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
38 ms |
1872 KB |
Output is correct |
| 27 |
Correct |
37 ms |
1872 KB |
Output is correct |
| 28 |
Correct |
38 ms |
1872 KB |
Output is correct |
| 29 |
Correct |
26 ms |
1832 KB |
Output is correct |
| 30 |
Correct |
21 ms |
1800 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 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 |
596 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 |
596 KB |
Output is correct |
| 17 |
Correct |
9 ms |
600 KB |
Output is correct |
| 18 |
Correct |
11 ms |
600 KB |
Output is correct |
| 19 |
Correct |
8 ms |
600 KB |
Output is correct |
| 20 |
Correct |
5 ms |
652 KB |
Output is correct |
| 21 |
Correct |
34 ms |
1036 KB |
Output is correct |
| 22 |
Correct |
42 ms |
1112 KB |
Output is correct |
| 23 |
Correct |
46 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
35 ms |
1112 KB |
Output is correct |
| 25 |
Correct |
32 ms |
1112 KB |
Output is correct |
| 26 |
Correct |
39 ms |
1112 KB |
Output is correct |
| 27 |
Correct |
36 ms |
1112 KB |
Output is correct |
| 28 |
Correct |
40 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
35 ms |
1112 KB |
Output is correct |
| 30 |
Correct |
27 ms |
1112 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
