#include <bits/stdc++.h>
using namespace std;
#include "gap.h"
/*
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;
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;
}
*/
typedef long long ll;
ll f(ll l, ll r, ll pl, ll pr, ll zz){
//cout << l << " " << r << " " << zz << " cc\n";
if(l > r || zz <= 0) return pr-pl;
ll mn,mx;
MinMax(l,r,&mn,&mx);
//cout << l << " " << r << " " << << " " << pr << " ss\n";
//cout << mn << " " << mx << " aa\n";
ll t = max(mn-pl , pr-mx);
return max(t , f(mn+1,mx-1,mn,mx,zz-2));
}
long long findGap(int T, int n){
if(n < 10) assert(0);
if(T == 1) return f(0,1e18,1e18,0,n);
ll las=0, t=1, res=1, mn, mx;
for(;;){
MinMax(las+1,las+t,&mn,&mx);
if(mn == -1) t+=t;//{ t += t; continue; }
else { res = max(res , las ? mn-las : 0); las = mx; t = res; }
//MinMax(las+1,1e18+5,&mn,&mx);
if(t > 1e18) return res;
}
return 0;
}
/*
int main()
{
A[1] = 2;
A[2] = 3;
A[3] = 6;
A[4] = 8;
N = 4;
subtask_num = 2;
printf("%lld\n", findGap(2, 4));
printf("%lld\n", call_count);
}
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Correct |
2 ms |
592 KB |
Output is correct |
| 3 |
Correct |
2 ms |
604 KB |
Output is correct |
| 4 |
Correct |
2 ms |
604 KB |
Output is correct |
| 5 |
Correct |
2 ms |
652 KB |
Output is correct |
| 6 |
Correct |
2 ms |
696 KB |
Output is correct |
| 7 |
Correct |
2 ms |
756 KB |
Output is correct |
| 8 |
Correct |
2 ms |
772 KB |
Output is correct |
| 9 |
Correct |
2 ms |
772 KB |
Output is correct |
| 10 |
Correct |
2 ms |
772 KB |
Output is correct |
| 11 |
Correct |
2 ms |
772 KB |
Output is correct |
| 12 |
Correct |
2 ms |
832 KB |
Output is correct |
| 13 |
Correct |
3 ms |
832 KB |
Output is correct |
| 14 |
Correct |
3 ms |
832 KB |
Output is correct |
| 15 |
Correct |
3 ms |
832 KB |
Output is correct |
| 16 |
Correct |
16 ms |
1672 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1672 KB |
Output is correct |
| 18 |
Correct |
17 ms |
1672 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1676 KB |
Output is correct |
| 20 |
Correct |
11 ms |
1676 KB |
Output is correct |
| 21 |
Correct |
56 ms |
4620 KB |
Output is correct |
| 22 |
Correct |
83 ms |
4620 KB |
Output is correct |
| 23 |
Correct |
61 ms |
4668 KB |
Output is correct |
| 24 |
Correct |
56 ms |
4668 KB |
Output is correct |
| 25 |
Correct |
49 ms |
4668 KB |
Output is correct |
| 26 |
Correct |
78 ms |
4668 KB |
Output is correct |
| 27 |
Correct |
56 ms |
4668 KB |
Output is correct |
| 28 |
Correct |
69 ms |
4668 KB |
Output is correct |
| 29 |
Correct |
56 ms |
4668 KB |
Output is correct |
| 30 |
Correct |
42 ms |
4668 KB |
Output is correct |
| 31 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 32 |
Correct |
2 ms |
4668 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
2 ms |
4668 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Partially correct |
2 ms |
4668 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
4668 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
4668 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
4668 KB |
Partially correct |
| 6 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 7 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 8 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 9 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 10 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 11 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 12 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 13 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 14 |
Correct |
3 ms |
4668 KB |
Output is correct |
| 15 |
Correct |
3 ms |
4668 KB |
Output is correct |
| 16 |
Correct |
11 ms |
4668 KB |
Output is correct |
| 17 |
Correct |
11 ms |
4668 KB |
Output is correct |
| 18 |
Correct |
11 ms |
4668 KB |
Output is correct |
| 19 |
Correct |
11 ms |
4668 KB |
Output is correct |
| 20 |
Correct |
9 ms |
4668 KB |
Output is correct |
| 21 |
Correct |
38 ms |
4668 KB |
Output is correct |
| 22 |
Correct |
37 ms |
4668 KB |
Output is correct |
| 23 |
Correct |
35 ms |
4668 KB |
Output is correct |
| 24 |
Correct |
36 ms |
4668 KB |
Output is correct |
| 25 |
Correct |
66 ms |
4668 KB |
Output is correct |
| 26 |
Correct |
36 ms |
4668 KB |
Output is correct |
| 27 |
Correct |
43 ms |
4668 KB |
Output is correct |
| 28 |
Correct |
36 ms |
4668 KB |
Output is correct |
| 29 |
Correct |
36 ms |
4668 KB |
Output is correct |
| 30 |
Correct |
39 ms |
4668 KB |
Output is correct |
| 31 |
Correct |
2 ms |
4668 KB |
Output is correct |
| 32 |
Correct |
2 ms |
4668 KB |
Output is correct |
