#include <iostream>
#include "gap.h"
#define ll long long
using namespace std;
const ll M = 1e18;
ll l, r, z, p, a, b, sz, f;
long long findGap(int T, int N) {
MinMax(0, M, &a, &b);
if (T == 1) {
if (N == 2) return b-a;
l = a, r = b, f = -1e18;
for (int i=0; i<(N-1)/2; ++i) {
MinMax(l+1, r-1, &a, &b);
f = max(f, a-l);
f = max(f, r-b);
l = a, r = b;
}
return f;
}
l = a+1, r = b, p = a, f = -1e18;
sz = (b-a)/N;
f = sz;
while (l < r) {
z = min(r, l+sz);
MinMax(l, z, &a, &b);
l = z+1;
f = max(f, a-p);
if (b != -1) p = b;
}
return f;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2644 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2752 KB |
Output is correct |
| 17 |
Correct |
7 ms |
2592 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2592 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2588 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2572 KB |
Output is correct |
| 21 |
Correct |
29 ms |
2812 KB |
Output is correct |
| 22 |
Correct |
32 ms |
2856 KB |
Output is correct |
| 23 |
Correct |
30 ms |
2716 KB |
Output is correct |
| 24 |
Correct |
30 ms |
3108 KB |
Output is correct |
| 25 |
Correct |
26 ms |
2852 KB |
Output is correct |
| 26 |
Correct |
29 ms |
2852 KB |
Output is correct |
| 27 |
Correct |
29 ms |
2860 KB |
Output is correct |
| 28 |
Correct |
32 ms |
3156 KB |
Output is correct |
| 29 |
Correct |
29 ms |
2856 KB |
Output is correct |
| 30 |
Correct |
24 ms |
2856 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2644 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
10 ms |
2752 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2576 KB |
Output is correct |
| 18 |
Correct |
10 ms |
2588 KB |
Output is correct |
| 19 |
Correct |
10 ms |
2584 KB |
Output is correct |
| 20 |
Correct |
5 ms |
2576 KB |
Output is correct |
| 21 |
Correct |
41 ms |
2848 KB |
Output is correct |
| 22 |
Correct |
42 ms |
2852 KB |
Output is correct |
| 23 |
Correct |
40 ms |
2856 KB |
Output is correct |
| 24 |
Correct |
40 ms |
2856 KB |
Output is correct |
| 25 |
Correct |
38 ms |
2860 KB |
Output is correct |
| 26 |
Correct |
41 ms |
2860 KB |
Output is correct |
| 27 |
Correct |
41 ms |
3024 KB |
Output is correct |
| 28 |
Correct |
41 ms |
2860 KB |
Output is correct |
| 29 |
Correct |
41 ms |
2856 KB |
Output is correct |
| 30 |
Correct |
23 ms |
3108 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
