#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll subtask1(int N);
ll subtask2(ll s = 0, ll e = 1e18)
{
if(s >= e) return 0;
if(e - s == 1)
{
ll mn, mx;
MinMax(s, e, &mn, &mx);
return mx - mn;
}
ll diff = (e - s + 1) / 3;
ll mid1 = s + diff, mid2 = mid1 + diff;
ll mx1, mx2, mx3, mn1, mn2, mn3;
MinMax(s, mid1, &mn1, &mx1);
MinMax(mid1 + 1, mid2, &mn2, &mx2);
MinMax(mid2 + 1, e, &mn3, &mx3);
if(mn2 == -1 && mn3 == -1) return subtask2(mn1, mx1);
if(mn1 == -1 && mn3 == -1) return subtask2(mn2, mx2);
if(mn1 == -1 && mn2 == -1) return subtask2(mn3, mx3);
if(mn1 == -1)
{
ll ans = mn3 - mx2;
if(ans < mx3 - mn3)
ans = max(ans, subtask2(mn3, mx3));
if(ans < mx2 - mn2)
ans = max(ans, subtask2(mn2, mx2));
return ans;
}
if(mn2 == -1)
{
ll ans = mn3 - mx1;
if(ans < mx3 - mn3)
ans = max(ans, subtask2(mn3, mx3));
if(ans < mx1 - mn1)
ans = max(ans, subtask2(mn1, mx1));
return ans;
}
if(mn3 == -1)
{
ll ans = mn2 - mx1;
if(ans < mx1 - mn1)
ans = max(ans, subtask2(mn1, mx1));
if(ans < mx2 - mn2)
ans = max(ans, subtask2(mn2, mx2));
return ans;
}
ll ans = max(mn2 - mx1, mn3 - mx2);
if(ans < mx1 - mn1)
ans = max(ans, subtask2(mn1, mx1));
if(ans < mx2 - mn2)
ans = max(ans, subtask2(mn2, mx2));
if(ans < mx3 - mn3)
ans = max(ans, subtask2(mn3, mx3));
return ans;
}
ll findGap(int T, int N)
{
if(T == 1)
return subtask1(N);
return subtask2();
}
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:125:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
125 | for(int i = 1; i < v.size(); i++)
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 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 |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
6 ms |
712 KB |
Output is correct |
| 17 |
Correct |
6 ms |
612 KB |
Output is correct |
| 18 |
Correct |
6 ms |
808 KB |
Output is correct |
| 19 |
Correct |
7 ms |
856 KB |
Output is correct |
| 20 |
Correct |
5 ms |
852 KB |
Output is correct |
| 21 |
Correct |
30 ms |
1988 KB |
Output is correct |
| 22 |
Correct |
33 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
31 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
23 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 27 |
Correct |
26 ms |
1988 KB |
Output is correct |
| 28 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 29 |
Correct |
36 ms |
1880 KB |
Output is correct |
| 30 |
Correct |
20 ms |
1908 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 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 KB |
Output is correct |
| 5 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
424 KB |
Partially correct |
| 16 |
Partially correct |
11 ms |
632 KB |
Partially correct |
| 17 |
Partially correct |
8 ms |
616 KB |
Partially correct |
| 18 |
Partially correct |
8 ms |
600 KB |
Partially correct |
| 19 |
Partially correct |
8 ms |
600 KB |
Partially correct |
| 20 |
Correct |
2 ms |
600 KB |
Output is correct |
| 21 |
Partially correct |
34 ms |
1112 KB |
Partially correct |
| 22 |
Partially correct |
34 ms |
1112 KB |
Partially correct |
| 23 |
Partially correct |
43 ms |
1104 KB |
Partially correct |
| 24 |
Partially correct |
34 ms |
980 KB |
Partially correct |
| 25 |
Partially correct |
38 ms |
1112 KB |
Partially correct |
| 26 |
Partially correct |
34 ms |
1112 KB |
Partially correct |
| 27 |
Partially correct |
34 ms |
1112 KB |
Partially correct |
| 28 |
Partially correct |
35 ms |
1112 KB |
Partially correct |
| 29 |
Partially correct |
35 ms |
1112 KB |
Partially correct |
| 30 |
Correct |
7 ms |
1112 KB |
Output is correct |
| 31 |
Correct |
1 ms |
344 KB |
Output is correct |
| 32 |
Correct |
1 ms |
344 KB |
Output is correct |
