#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll subtask1(int N);
// [0] = ans, [1] = mi, [2] = mx
vector<ll> subtask2(ll s = -1, ll e = 1'000'000'000'000'000'001)
{
if(s > e) return {-1, -1, -1};
ll mid = (s + e) / 2;
ll mn1, mn2, mx1, mx2;
MinMax(s, mid, &mn1, &mn2);
MinMax(mid + 1, e, &mn2, &mx2);
ll ans = -1;
if(mn1 != -1)
{
vector<ll> v = subtask2(mn1 + 1, mx1 - 1);
if(v[0] == -1)
ans = max(ans, mx1 - mn1);
else
{
ans = max(v[0], ans);
ans = max(v[1] - mn1, ans);
ans = max(mx1 - v[2], ans);
}
}
if(mn2 != -1)
{
vector<ll> v = subtask2(mn2 + 1, mx2 - 1);
if(v[0] == -1)
ans = max(ans, mx2 - mn2);
else
{
ans = max(v[0], ans);
ans = max(v[1] - mn2, ans);
ans = max(mx2 - v[2], ans);
}
}
if(mn1 != -1 && mn2 != -1) ans = max(ans, mn2 - mx1);
return {ans, mn1, mx2};
}
ll findGap(int T, int N)
{
if(T == 1)
return subtask1(N);
return subtask2().at(0);
}
ll subtask1(int N)
{
int i = 0, j = N - 1;
ll s = 0, e = 1e18;
ll *mn = new ll, *mx = new ll;
vector<ll> v(N);
while(i <= j && s <= e)
{
MinMax(s, e, mn, mx);
v[i] = *mn;
v[j] = *mx;
i++, j--;
s = *mn + 1;
e = *mx - 1;
}
ll ans = 0;
for(int i = 1; i < v.size(); i++)
ans = max(ans, v[i] - v[i - 1]);
return ans;
}
Compilation message
gap.cpp: In function 'll subtask1(int)':
gap.cpp:78:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
78 | for(int i = 1; i < v.size(); i++)
| ~~^~~~~~~~~~
gap.cpp: In function 'std::vector<long long int> subtask2(ll, ll)':
gap.cpp:24:47: warning: 'mx1' may be used uninitialized in this function [-Wmaybe-uninitialized]
24 | vector<ll> v = subtask2(mn1 + 1, mx1 - 1);
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 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 |
596 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
0 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
344 KB |
Output is correct |
| 16 |
Correct |
6 ms |
844 KB |
Output is correct |
| 17 |
Correct |
8 ms |
692 KB |
Output is correct |
| 18 |
Correct |
6 ms |
852 KB |
Output is correct |
| 19 |
Correct |
6 ms |
856 KB |
Output is correct |
| 20 |
Correct |
6 ms |
856 KB |
Output is correct |
| 21 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 22 |
Correct |
25 ms |
1908 KB |
Output is correct |
| 23 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
22 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
23 ms |
1904 KB |
Output is correct |
| 27 |
Correct |
24 ms |
1880 KB |
Output is correct |
| 28 |
Correct |
32 ms |
1880 KB |
Output is correct |
| 29 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 30 |
Correct |
25 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 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 16 |
Incorrect |
4 ms |
600 KB |
Output isn't correct |
| 17 |
Incorrect |
3 ms |
568 KB |
Output isn't correct |
| 18 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
| 19 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
| 20 |
Incorrect |
2 ms |
600 KB |
Output isn't correct |
| 21 |
Incorrect |
12 ms |
1080 KB |
Output isn't correct |
| 22 |
Incorrect |
19 ms |
1112 KB |
Output isn't correct |
| 23 |
Incorrect |
16 ms |
1184 KB |
Output isn't correct |
| 24 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
| 25 |
Incorrect |
10 ms |
1108 KB |
Output isn't correct |
| 26 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
| 27 |
Incorrect |
20 ms |
1192 KB |
Output isn't correct |
| 28 |
Incorrect |
14 ms |
1112 KB |
Output isn't correct |
| 29 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
| 30 |
Incorrect |
7 ms |
1112 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
