#include "gap.h"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll findGap(int T, int N) {
if (T == 1) {
vector<ll> res(N);
ll l = 0, r = 1e18, mn, mx, lidx = 0, ridx = N - 1;
for (int i = 0; i < (N + 1) / 2; i++) {
MinMax(l, r, &mn, &mx);
res[lidx++] = mn, res[ridx--] = mx;
l = mn + 1, r = mx - 1;
}
ll ret = 0;
for (int i = 1; i < N; i++)
ret = max(ret, res[i] - res[i - 1]);
return ret;
} else {
ll l = 0, r = 1e18, ret = 0, mn, mx;
MinMax(l, r, &mn, &mx);
r = mx;
ll gap = mx - mn, new_gap = gap / N;
ll x = mn;
while (1) {
MinMax(x, x + new_gap, &mn, &mx);
if (mx == -1) {
ret = max(ret, mn - x);
x = mn;
if (mn == r)
break;
} else {
ret = max(ret, mn - x);
x = mx;
if (x == r)
break;
}
}
return ret;
}
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
344 KB |
Output is correct |
| 16 |
Correct |
9 ms |
684 KB |
Output is correct |
| 17 |
Correct |
6 ms |
832 KB |
Output is correct |
| 18 |
Correct |
10 ms |
660 KB |
Output is correct |
| 19 |
Correct |
10 ms |
660 KB |
Output is correct |
| 20 |
Correct |
6 ms |
660 KB |
Output is correct |
| 21 |
Correct |
43 ms |
1880 KB |
Output is correct |
| 22 |
Correct |
32 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
42 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
24 ms |
1876 KB |
Output is correct |
| 26 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 27 |
Correct |
29 ms |
1880 KB |
Output is correct |
| 28 |
Correct |
39 ms |
2180 KB |
Output is correct |
| 29 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 30 |
Correct |
32 ms |
1880 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 |
Execution timed out |
3077 ms |
344 KB |
Time limit exceeded |
| 2 |
Execution timed out |
3040 ms |
344 KB |
Time limit exceeded |
| 3 |
Execution timed out |
3046 ms |
344 KB |
Time limit exceeded |
| 4 |
Execution timed out |
3024 ms |
344 KB |
Time limit exceeded |
| 5 |
Execution timed out |
3067 ms |
344 KB |
Time limit exceeded |
| 6 |
Execution timed out |
3076 ms |
344 KB |
Time limit exceeded |
| 7 |
Execution timed out |
3050 ms |
344 KB |
Time limit exceeded |
| 8 |
Execution timed out |
3068 ms |
344 KB |
Time limit exceeded |
| 9 |
Execution timed out |
3063 ms |
344 KB |
Time limit exceeded |
| 10 |
Execution timed out |
3061 ms |
344 KB |
Time limit exceeded |
| 11 |
Execution timed out |
3064 ms |
344 KB |
Time limit exceeded |
| 12 |
Execution timed out |
3032 ms |
344 KB |
Time limit exceeded |
| 13 |
Execution timed out |
3045 ms |
344 KB |
Time limit exceeded |
| 14 |
Execution timed out |
3019 ms |
344 KB |
Time limit exceeded |
| 15 |
Execution timed out |
3072 ms |
344 KB |
Time limit exceeded |
| 16 |
Execution timed out |
3061 ms |
600 KB |
Time limit exceeded |
| 17 |
Execution timed out |
3025 ms |
600 KB |
Time limit exceeded |
| 18 |
Execution timed out |
3053 ms |
600 KB |
Time limit exceeded |
| 19 |
Execution timed out |
3007 ms |
600 KB |
Time limit exceeded |
| 20 |
Execution timed out |
3055 ms |
600 KB |
Time limit exceeded |
| 21 |
Execution timed out |
3055 ms |
1112 KB |
Time limit exceeded |
| 22 |
Execution timed out |
3005 ms |
1112 KB |
Time limit exceeded |
| 23 |
Execution timed out |
3057 ms |
1112 KB |
Time limit exceeded |
| 24 |
Execution timed out |
3064 ms |
1112 KB |
Time limit exceeded |
| 25 |
Execution timed out |
3063 ms |
1112 KB |
Time limit exceeded |
| 26 |
Execution timed out |
3052 ms |
1112 KB |
Time limit exceeded |
| 27 |
Execution timed out |
3030 ms |
1112 KB |
Time limit exceeded |
| 28 |
Execution timed out |
3037 ms |
1112 KB |
Time limit exceeded |
| 29 |
Execution timed out |
3027 ms |
1112 KB |
Time limit exceeded |
| 30 |
Execution timed out |
3003 ms |
1112 KB |
Time limit exceeded |
| 31 |
Execution timed out |
3034 ms |
344 KB |
Time limit exceeded |
| 32 |
Execution timed out |
3077 ms |
344 KB |
Time limit exceeded |
