#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long ans = 0;
long long dfs(long long l, long long r)
{
if (r - l <= ans)
return ans;
if (r - l <= 1)
return ans = max(ans, r - l);
if (r - l == 2)
{
long long tl, tr;
MinMax(l, l + 1, &tl, &tr);
if (tr == l + 1)
return ans = max(ans, 1LL);
else
return ans = max(ans, 2LL);
}
if (r - l == 3)
{
long long tl, tr;
MinMax(l + 1, r - 1, &tl, &tr);
if (tl == l + 1 && tr == r + 1)
return ans = max(ans, 1LL);
else if (tl == l + 1 || tr == r + 1)
return ans = max(ans, 2LL);
else
return ans = max(ans, 3LL);
}
long long m = (l + r) / 2, ll, lr, rl, rr;
MinMax(l + 1, m, &ll, &lr), MinMax(m + 1, r - 1, &rl, &rr);
long long ret = ans;
if (ll == -1 && rr == -1)
ret = r - l;
else if (ll == -1)
{
ret = max({ret, rl - l, r - rr});
if (rr - rl > ret)
ret = max(ret, dfs(rl, rr));
}
else if (rr == -1)
{
ret = max({ret, ll - l, r - lr});
if (lr - ll > ret)
ret = max(ret, dfs(ll, lr));
}
else
{
ret = max({ret, ll - l, rl - lr, r - rr});
if (lr - ll > ret)
ret = max(ret, dfs(ll, lr));
if (rr - rl > ret)
ret = max(ret, dfs(rl, rr));
}
return ans = max(ans, ret);
}
long long findGap(int T, int N)
{
long long l, r;
MinMax(0, 1000000000000000000, &l, &r);
return dfs(l, r);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
0 ms |
364 KB |
Output is correct |
| 10 |
Correct |
0 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
364 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 16 |
Correct |
8 ms |
492 KB |
Output is correct |
| 17 |
Correct |
9 ms |
492 KB |
Output is correct |
| 18 |
Correct |
8 ms |
492 KB |
Output is correct |
| 19 |
Correct |
9 ms |
492 KB |
Output is correct |
| 20 |
Correct |
3 ms |
492 KB |
Output is correct |
| 21 |
Correct |
32 ms |
1132 KB |
Output is correct |
| 22 |
Correct |
34 ms |
1132 KB |
Output is correct |
| 23 |
Correct |
39 ms |
1132 KB |
Output is correct |
| 24 |
Correct |
33 ms |
1132 KB |
Output is correct |
| 25 |
Incorrect |
50 ms |
1236 KB |
Output isn't correct |
| 26 |
Correct |
32 ms |
1132 KB |
Output is correct |
| 27 |
Correct |
31 ms |
1132 KB |
Output is correct |
| 28 |
Correct |
35 ms |
1232 KB |
Output is correct |
| 29 |
Correct |
32 ms |
1132 KB |
Output is correct |
| 30 |
Correct |
14 ms |
1132 KB |
Output is correct |
| 31 |
Correct |
0 ms |
364 KB |
Output is correct |
| 32 |
Correct |
0 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Partially correct |
0 ms |
364 KB |
Partially correct |
| 6 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
364 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
364 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
364 KB |
Partially correct |
| 10 |
Correct |
0 ms |
364 KB |
Output is correct |
| 11 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 16 |
Partially correct |
10 ms |
492 KB |
Partially correct |
| 17 |
Partially correct |
10 ms |
492 KB |
Partially correct |
| 18 |
Partially correct |
9 ms |
492 KB |
Partially correct |
| 19 |
Partially correct |
9 ms |
492 KB |
Partially correct |
| 20 |
Correct |
3 ms |
492 KB |
Output is correct |
| 21 |
Partially correct |
32 ms |
1132 KB |
Partially correct |
| 22 |
Partially correct |
32 ms |
1132 KB |
Partially correct |
| 23 |
Partially correct |
32 ms |
1152 KB |
Partially correct |
| 24 |
Partially correct |
34 ms |
1260 KB |
Partially correct |
| 25 |
Partially correct |
48 ms |
1132 KB |
Partially correct |
| 26 |
Partially correct |
34 ms |
1132 KB |
Partially correct |
| 27 |
Partially correct |
33 ms |
1092 KB |
Partially correct |
| 28 |
Partially correct |
39 ms |
1132 KB |
Partially correct |
| 29 |
Partially correct |
31 ms |
1200 KB |
Partially correct |
| 30 |
Correct |
12 ms |
1260 KB |
Output is correct |
| 31 |
Correct |
1 ms |
364 KB |
Output is correct |
| 32 |
Correct |
1 ms |
364 KB |
Output is correct |
