#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 1e18;
ll a[100000], j = 0;
ll findGap(int T, int N) {
if (T == 1) {
ll l = 1, r = MAXN;
ll mn, mx;
vector<ll> v;
for (ll i = 0; i < (N + 1) / 2; i++) {
MinMax(l, r, &mn, &mx);
a[j++] = mn;
a[j++] = mx;
l = mn + 1, r = mx - 1;
}
sort(a, a + N);
ll ans = 0;
for (ll i = 0; i < N - 1; i++) ans = max(ans, a[i + 1] - a[i]);
return ans;
} else {
ll mn, mx;
MinMax(1, MAXN, &mn, &mx);
ll step = (mx - mn + N - 2) / (N - 1);
ll ans = step, x, y, l = mn, i;
for (i = mn; i + step < mx; i += step + 1) {
MinMax(i, i + step, &x, &y);
if (x != -1) {
ans = max(ans, x - l);
l = y;
}
}
MinMax(i, mx, &x, &y);
if (x != -1) ans = max(ans, x - l);
return ans;
}
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
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 |
1 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 |
620 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 |
728 KB |
Output is correct |
| 17 |
Correct |
8 ms |
648 KB |
Output is correct |
| 18 |
Correct |
8 ms |
644 KB |
Output is correct |
| 19 |
Correct |
8 ms |
856 KB |
Output is correct |
| 20 |
Correct |
7 ms |
616 KB |
Output is correct |
| 21 |
Correct |
31 ms |
1968 KB |
Output is correct |
| 22 |
Correct |
33 ms |
2456 KB |
Output is correct |
| 23 |
Correct |
31 ms |
1820 KB |
Output is correct |
| 24 |
Correct |
31 ms |
1980 KB |
Output is correct |
| 25 |
Correct |
34 ms |
1964 KB |
Output is correct |
| 26 |
Correct |
33 ms |
1824 KB |
Output is correct |
| 27 |
Correct |
31 ms |
1932 KB |
Output is correct |
| 28 |
Correct |
32 ms |
2132 KB |
Output is correct |
| 29 |
Correct |
31 ms |
1972 KB |
Output is correct |
| 30 |
Correct |
27 ms |
1960 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 |
0 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 |
10 ms |
908 KB |
Output is correct |
| 17 |
Correct |
10 ms |
644 KB |
Output is correct |
| 18 |
Correct |
10 ms |
656 KB |
Output is correct |
| 19 |
Correct |
10 ms |
648 KB |
Output is correct |
| 20 |
Correct |
5 ms |
584 KB |
Output is correct |
| 21 |
Correct |
40 ms |
1392 KB |
Output is correct |
| 22 |
Correct |
40 ms |
1220 KB |
Output is correct |
| 23 |
Correct |
41 ms |
1240 KB |
Output is correct |
| 24 |
Correct |
42 ms |
1220 KB |
Output is correct |
| 25 |
Correct |
44 ms |
1212 KB |
Output is correct |
| 26 |
Correct |
40 ms |
1212 KB |
Output is correct |
| 27 |
Correct |
40 ms |
1380 KB |
Output is correct |
| 28 |
Correct |
40 ms |
1232 KB |
Output is correct |
| 29 |
Correct |
40 ms |
1224 KB |
Output is correct |
| 30 |
Correct |
21 ms |
1192 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
