#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;
ll mid = (s + e) / 2;
ll mx1, mx2, mn1, mn2;
MinMax(s, mid, &mn1, &mx1);
MinMax(mid + 1, e, &mn2, &mx2);
if(mn2 == -1) return subtask2(mn1, mx1);
if(mn1 == -1) return subtask2(mn2, mx2);
ll ans = mn2 - mx1;
if(ans < mx1 - mn1)
ans = max(ans, subtask2(mn1, mx1));
if(ans < mx2 - mn2)
ans = max(ans, subtask2(mn1, mx1));
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:76:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | for(int i = 1; i < v.size(); i++)
| ~~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
2392 KB |
Output is correct |
3 |
Correct |
0 ms |
2392 KB |
Output is correct |
4 |
Correct |
0 ms |
2392 KB |
Output is correct |
5 |
Correct |
1 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
0 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Correct |
0 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 |
2392 KB |
Output is correct |
15 |
Correct |
1 ms |
2472 KB |
Output is correct |
16 |
Correct |
7 ms |
2648 KB |
Output is correct |
17 |
Correct |
6 ms |
2648 KB |
Output is correct |
18 |
Correct |
7 ms |
2648 KB |
Output is correct |
19 |
Correct |
9 ms |
2740 KB |
Output is correct |
20 |
Correct |
5 ms |
2648 KB |
Output is correct |
21 |
Correct |
27 ms |
3408 KB |
Output is correct |
22 |
Correct |
32 ms |
3416 KB |
Output is correct |
23 |
Correct |
36 ms |
3408 KB |
Output is correct |
24 |
Correct |
23 ms |
3416 KB |
Output is correct |
25 |
Correct |
24 ms |
3416 KB |
Output is correct |
26 |
Correct |
23 ms |
3416 KB |
Output is correct |
27 |
Correct |
21 ms |
3508 KB |
Output is correct |
28 |
Correct |
32 ms |
3416 KB |
Output is correct |
29 |
Correct |
32 ms |
3560 KB |
Output is correct |
30 |
Correct |
18 ms |
3416 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 |
1 ms |
2392 KB |
Output is correct |
2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
4 |
Correct |
0 ms |
2392 KB |
Output is correct |
5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
6 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
7 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
8 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
15 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
16 |
Incorrect |
7 ms |
2392 KB |
Output isn't correct |
17 |
Incorrect |
6 ms |
2392 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
2392 KB |
Output isn't correct |
19 |
Incorrect |
6 ms |
2392 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
2392 KB |
Output isn't correct |
21 |
Incorrect |
15 ms |
2648 KB |
Output isn't correct |
22 |
Incorrect |
24 ms |
2648 KB |
Output isn't correct |
23 |
Incorrect |
20 ms |
2864 KB |
Output isn't correct |
24 |
Incorrect |
39 ms |
2648 KB |
Output isn't correct |
25 |
Partially correct |
25 ms |
2648 KB |
Partially correct |
26 |
Incorrect |
28 ms |
2648 KB |
Output isn't correct |
27 |
Incorrect |
29 ms |
2648 KB |
Output isn't correct |
28 |
Incorrect |
27 ms |
2824 KB |
Output isn't correct |
29 |
Incorrect |
20 ms |
2648 KB |
Output isn't correct |
30 |
Incorrect |
7 ms |
2648 KB |
Output isn't correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |