#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
//#define DEBUG
#ifdef DEBUG
int n = 5;
ll a[5] = {2, 3, 6, 8, 12};
void MinMax(ll x, ll y, ll *mn, ll *mx) {
for (int i = 0; i < n; ++i) if (a[i] >= x)
{ (*mn) = a[i]; break; }
for (int i = n - 1; i >= 0; --i) if (a[i] <= y)
{ (*mx) = a[i]; break; }
if ((*mx) < (*mn)) (*mx) = (*mn) = -1;
}
#endif
ll findGap(int _t, int _n) {
ll n = _n;
ll mn = 1, mx = (ll)1e18;
MinMax(mn, mx, &mn, &mx);
if (_t == 2) {
ll d = (mx - mn) / (n - 1ll) + ((mx - mn) % (n - 1ll) != 0ll), pre = mn;
ll pstep = mn, step = mn + d - 1, gap = 0;
while (1) {
ll mntmp = -1, mxtmp = -1;
if (pstep <= min(mx - 1, step)) MinMax(pstep + 1, min(mx - 1, step), &mntmp, &mxtmp);
if (step >= mx) {
if (mxtmp != -1) gap = max(gap, mx - mxtmp);
else gap = max(gap, mx - pre);
break;
} else if (mntmp != -1) gap = max(gap, mntmp - pre);
pre = max(pre, mxtmp), pstep = step, step += d;
}
return gap;
} else {
vector<ll> a;
a.resize(n);
a[0] = mn, a[n - 1] = mx;
int lo = 0, hi = n - 1;
while (hi - lo > 1) {
MinMax(a[lo] + 1ll, a[hi] - 1ll, &mn, &mx);
++lo, --hi;
a[lo] = mn, a[hi] = mx;
}
ll gap = 0;
for (int i = 0; i < n - 1; ++i) gap = max(gap, a[i + 1] - a[i]);
return gap;
}
return 0ll;
}
#ifdef DEBUG
int main() {
printf("%d", findGap(1, 5));
return 0;
}
#endif
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
480 KB |
Output is correct |
| 3 |
Correct |
1 ms |
480 KB |
Output is correct |
| 4 |
Correct |
1 ms |
480 KB |
Output is correct |
| 5 |
Correct |
2 ms |
616 KB |
Output is correct |
| 6 |
Correct |
1 ms |
616 KB |
Output is correct |
| 7 |
Correct |
2 ms |
616 KB |
Output is correct |
| 8 |
Correct |
1 ms |
616 KB |
Output is correct |
| 9 |
Correct |
1 ms |
616 KB |
Output is correct |
| 10 |
Correct |
2 ms |
616 KB |
Output is correct |
| 11 |
Correct |
3 ms |
616 KB |
Output is correct |
| 12 |
Correct |
2 ms |
616 KB |
Output is correct |
| 13 |
Correct |
2 ms |
616 KB |
Output is correct |
| 14 |
Correct |
2 ms |
616 KB |
Output is correct |
| 15 |
Correct |
2 ms |
620 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1092 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1092 KB |
Output is correct |
| 18 |
Correct |
16 ms |
1092 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1092 KB |
Output is correct |
| 20 |
Correct |
11 ms |
1092 KB |
Output is correct |
| 21 |
Correct |
59 ms |
2156 KB |
Output is correct |
| 22 |
Correct |
56 ms |
2156 KB |
Output is correct |
| 23 |
Correct |
57 ms |
2156 KB |
Output is correct |
| 24 |
Correct |
61 ms |
2284 KB |
Output is correct |
| 25 |
Correct |
48 ms |
2284 KB |
Output is correct |
| 26 |
Correct |
55 ms |
2284 KB |
Output is correct |
| 27 |
Correct |
58 ms |
2284 KB |
Output is correct |
| 28 |
Correct |
57 ms |
2284 KB |
Output is correct |
| 29 |
Correct |
56 ms |
2284 KB |
Output is correct |
| 30 |
Correct |
43 ms |
2284 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2284 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2284 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
1 ms |
2284 KB |
Execution failed because the return code was nonzero |
| 2 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2284 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 5 |
Runtime error |
1 ms |
2284 KB |
Execution failed because the return code was nonzero |
| 6 |
Correct |
1 ms |
2284 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2284 KB |
Output is correct |
| 10 |
Incorrect |
1 ms |
2284 KB |
Output isn't correct |
| 11 |
Correct |
3 ms |
2284 KB |
Output is correct |
| 12 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 14 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 15 |
Runtime error |
2 ms |
2284 KB |
Execution failed because the return code was nonzero |
| 16 |
Correct |
25 ms |
2284 KB |
Output is correct |
| 17 |
Correct |
20 ms |
2284 KB |
Output is correct |
| 18 |
Correct |
26 ms |
2284 KB |
Output is correct |
| 19 |
Correct |
35 ms |
2284 KB |
Output is correct |
| 20 |
Correct |
9 ms |
2284 KB |
Output is correct |
| 21 |
Correct |
76 ms |
2284 KB |
Output is correct |
| 22 |
Correct |
85 ms |
2284 KB |
Output is correct |
| 23 |
Correct |
76 ms |
2284 KB |
Output is correct |
| 24 |
Correct |
74 ms |
2284 KB |
Output is correct |
| 25 |
Runtime error |
69 ms |
2284 KB |
Execution failed because the return code was nonzero |
| 26 |
Correct |
78 ms |
2284 KB |
Output is correct |
| 27 |
Correct |
74 ms |
2284 KB |
Output is correct |
| 28 |
Correct |
74 ms |
2284 KB |
Output is correct |
| 29 |
Correct |
74 ms |
2284 KB |
Output is correct |
| 30 |
Correct |
40 ms |
2284 KB |
Output is correct |
| 31 |
Runtime error |
2 ms |
2284 KB |
Execution failed because the return code was nonzero |
| 32 |
Runtime error |
2 ms |
2284 KB |
Execution failed because the return code was nonzero |
