# include "gap.h"
# include <bits/stdc++.h>
# define x first
# define y second
# define mp make_pair
// everything go according to my plan
# define pb push_back
# define sz(a) (int)(a.size())
# define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
# define y1 Y_U_NO_y1
# define left Y_U_NO_left
# define right Y_U_NO_right
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef long double ld;
const int Mod = (int)1e9 + 7;
const int MX = 1073741822;
const ll MXLL = 4e18;
const int Sz = 1110111;
// a pinch of soul
const ll N = 1e18;
ll solve_1 ( int n) {
ll a[n + 2];
a[n + 1] = N + 1;
a[0] = -1;
for (int l = 1; l <= (n + 1) / 2; l++) {
int r = n - l + 1;
MinMax (a[l - 1] + 1, a[r + 1] - 1, a + l, a + r);
}
ll ans = 0;
for (int i = 1; i < n; i++)
ans = max (ans, a[i + 1] - a[i]);
return ans;
}
ll solve_2 (int n) {
ll F, S;
MinMax (1ll, N, &F, &S);
ll len = max (1ll, ((S - F - 1) / (n - 1)));
ll last = F;
ll ans = len;
F++;
for (ll i = 1; i < n; i++) {
ll x, y;
MinMax (F + (i - 1) * len, F + i * len - 1, &x, &y);
if (~x) {
ans = max (ans, x - last);
last = y;
}
}
return ans;
}
ll findGap (int t, int n) {
if (t == 1)
return solve_1 (n);
else
return solve_2 (n);
}
// Coded by Z..
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
432 KB |
Output is correct |
| 4 |
Correct |
2 ms |
636 KB |
Output is correct |
| 5 |
Correct |
2 ms |
636 KB |
Output is correct |
| 6 |
Correct |
2 ms |
636 KB |
Output is correct |
| 7 |
Correct |
2 ms |
636 KB |
Output is correct |
| 8 |
Correct |
2 ms |
636 KB |
Output is correct |
| 9 |
Correct |
2 ms |
636 KB |
Output is correct |
| 10 |
Correct |
2 ms |
636 KB |
Output is correct |
| 11 |
Correct |
2 ms |
636 KB |
Output is correct |
| 12 |
Correct |
3 ms |
636 KB |
Output is correct |
| 13 |
Correct |
23 ms |
636 KB |
Output is correct |
| 14 |
Correct |
2 ms |
636 KB |
Output is correct |
| 15 |
Correct |
2 ms |
636 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1024 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1024 KB |
Output is correct |
| 18 |
Correct |
15 ms |
1024 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1024 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1024 KB |
Output is correct |
| 21 |
Correct |
58 ms |
2172 KB |
Output is correct |
| 22 |
Correct |
56 ms |
2172 KB |
Output is correct |
| 23 |
Correct |
57 ms |
2172 KB |
Output is correct |
| 24 |
Correct |
57 ms |
2172 KB |
Output is correct |
| 25 |
Correct |
49 ms |
2172 KB |
Output is correct |
| 26 |
Correct |
79 ms |
2172 KB |
Output is correct |
| 27 |
Correct |
59 ms |
2176 KB |
Output is correct |
| 28 |
Correct |
59 ms |
2176 KB |
Output is correct |
| 29 |
Correct |
57 ms |
2176 KB |
Output is correct |
| 30 |
Correct |
41 ms |
2300 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2300 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2300 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 2 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 11 |
Correct |
3 ms |
2300 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2300 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2300 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2300 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2300 KB |
Output is correct |
| 16 |
Correct |
19 ms |
2300 KB |
Output is correct |
| 17 |
Correct |
22 ms |
2300 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2300 KB |
Output is correct |
| 19 |
Correct |
24 ms |
2300 KB |
Output is correct |
| 20 |
Incorrect |
10 ms |
2300 KB |
Output isn't correct |
| 21 |
Correct |
74 ms |
2300 KB |
Output is correct |
| 22 |
Correct |
73 ms |
2300 KB |
Output is correct |
| 23 |
Correct |
78 ms |
2300 KB |
Output is correct |
| 24 |
Correct |
79 ms |
2300 KB |
Output is correct |
| 25 |
Correct |
67 ms |
2300 KB |
Output is correct |
| 26 |
Correct |
75 ms |
2300 KB |
Output is correct |
| 27 |
Correct |
75 ms |
2300 KB |
Output is correct |
| 28 |
Correct |
77 ms |
2300 KB |
Output is correct |
| 29 |
Correct |
82 ms |
2300 KB |
Output is correct |
| 30 |
Incorrect |
38 ms |
2300 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 32 |
Correct |
2 ms |
2300 KB |
Output is correct |
