#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
/*
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
long long findGap(int, int);
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}
*/
ll findGap(int T, int N) {
if(T==1) {
ll mn, mx, ans = 0;
MinMax(0,1e18,&mn,&mx);
//if(N==2) {return mx-mn;}
for(int i=0;i<(N-1)/2;i++) {
ll nMn, nMx;
MinMax(mn+1,mx-1,&nMn,&nMx);
ans=max({ans,nMn-mn,mx-nMx});
mn=nMn;
mx=nMx;
}
ans=max(ans,mx-mn);
return ans;
}
}
/*
int main()
{
FILE *in = stdin, *out = stdout;
my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
my_assert(1 <= subtask_num && subtask_num <= 2);
my_assert(2 <= N && N <= 100000);
for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
fprintf(out, "%lld\n", findGap(subtask_num, N));
fprintf(out, "%lld\n", call_count);
}
*/
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
53 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2648 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 |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 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 |
2656 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 |
8 ms |
2584 KB |
Output is correct |
| 17 |
Correct |
7 ms |
2584 KB |
Output is correct |
| 18 |
Correct |
7 ms |
2588 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2572 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2544 KB |
Output is correct |
| 21 |
Correct |
28 ms |
2852 KB |
Output is correct |
| 22 |
Correct |
29 ms |
2908 KB |
Output is correct |
| 23 |
Correct |
32 ms |
2860 KB |
Output is correct |
| 24 |
Correct |
28 ms |
2860 KB |
Output is correct |
| 25 |
Correct |
24 ms |
2848 KB |
Output is correct |
| 26 |
Correct |
28 ms |
2836 KB |
Output is correct |
| 27 |
Correct |
35 ms |
2864 KB |
Output is correct |
| 28 |
Correct |
31 ms |
3256 KB |
Output is correct |
| 29 |
Correct |
28 ms |
2856 KB |
Output is correct |
| 30 |
Correct |
22 ms |
3060 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 6 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 10 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 16 |
Partially correct |
8 ms |
2588 KB |
Partially correct |
| 17 |
Partially correct |
7 ms |
2392 KB |
Partially correct |
| 18 |
Partially correct |
8 ms |
2584 KB |
Partially correct |
| 19 |
Partially correct |
7 ms |
2680 KB |
Partially correct |
| 20 |
Partially correct |
6 ms |
2548 KB |
Partially correct |
| 21 |
Incorrect |
32 ms |
3024 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
28 ms |
2860 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
27 ms |
3108 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
28 ms |
2944 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
25 ms |
2864 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
31 ms |
3108 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
28 ms |
2860 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
28 ms |
2856 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
28 ms |
2856 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
22 ms |
2852 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
