#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool adj(ll x,ll y)
{
long long a, b;
MinMax(x+1,y-1,&a,&b);
return a==-1;
}
long long findGap(signed t,signed n)
{
if (t==2 && n>60)
{
ll mn1,mx1;
MinMax(0,(ll)1e18,&mn1,&mx1);
ll st,mn,mx,ans=0;
for (int i=0;i<=60;i++)
{
MinMax(mn1+1,mn1+(1LL<<i),&mn,&mx);
if (mn!=-1)
{
ans=mn-mn1;
st=mx;
break;
}
}
while (st<mx1)
{
MinMax(st+1,st+ans,&mn,&mx);
if (mn!=-1)
st=mx;
else
{
ll val=ans*2;
while (1)
{
MinMax(st+1,st+val,&mn,&mx);
if (mn!=-1)
{
ans=mn-st;
st=mx;
break;
}
val*=2;
}
}
}
return ans;
}
else
{
long long lim1=0,lim2=1e18;
long long mn,mx,mn1,mx1;
MinMax(lim1,lim2,&mn1,&mx1);
if (n==2)
return mx1-mn1;
MinMax(mn1+1,mx1-1,&mn,&mx);
ll ans = max(mn-mn1,mx1-mx);
while (mn+ans*2<=mx)
{
MinMax(mn+ans,mx-ans,&mn1,&mx1);
if (mn1==-1)
break;
if (adj(mn,mn1))
ans=mn1-mn;
if (adj(mx1,mx))
ans=max(ans,mx-mx1);
mn=mn1,mx=mx1;
}
if (mn+ans<mx)
{
MinMax(mn+ans+1,mx,&mn1,&mx1);
if (mn1!=-1)
ans=mn1-mn;
else
{
MinMax(mn,mx-ans-1,&mn1,&mx1);
if (mx1!=-1)
ans=mx-mx1;
}
}
return ans;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:45:10: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
45 | ans=mn-st;
| ~~~^~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is 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 |
0 ms |
344 KB |
Output isn't correct |
| 10 |
Runtime error |
0 ms |
344 KB |
Execution failed because the return code was nonzero |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Incorrect |
1 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 |
5 ms |
616 KB |
Output isn't correct |
| 17 |
Incorrect |
5 ms |
600 KB |
Output isn't correct |
| 18 |
Incorrect |
7 ms |
600 KB |
Output isn't correct |
| 19 |
Incorrect |
5 ms |
600 KB |
Output isn't correct |
| 20 |
Runtime error |
2 ms |
600 KB |
Execution failed because the return code was nonzero |
| 21 |
Incorrect |
19 ms |
1236 KB |
Output isn't correct |
| 22 |
Incorrect |
18 ms |
1112 KB |
Output isn't correct |
| 23 |
Incorrect |
25 ms |
1240 KB |
Output isn't correct |
| 24 |
Incorrect |
19 ms |
1112 KB |
Output isn't correct |
| 25 |
Incorrect |
42 ms |
1112 KB |
Output isn't correct |
| 26 |
Incorrect |
19 ms |
1112 KB |
Output isn't correct |
| 27 |
Incorrect |
18 ms |
1112 KB |
Output isn't correct |
| 28 |
Incorrect |
19 ms |
1112 KB |
Output isn't correct |
| 29 |
Incorrect |
20 ms |
1112 KB |
Output isn't correct |
| 30 |
Runtime error |
7 ms |
1112 KB |
Execution failed because the return code was nonzero |
| 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 |
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 |
Partially correct |
0 ms |
344 KB |
Partially 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 |
0 ms |
344 KB |
Output is correct |
| 15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 16 |
Correct |
7 ms |
436 KB |
Output is correct |
| 17 |
Correct |
4 ms |
628 KB |
Output is correct |
| 18 |
Correct |
5 ms |
600 KB |
Output is correct |
| 19 |
Correct |
4 ms |
600 KB |
Output is correct |
| 20 |
Correct |
5 ms |
600 KB |
Output is correct |
| 21 |
Correct |
16 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
24 ms |
1116 KB |
Output is correct |
| 23 |
Correct |
16 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
16 ms |
1232 KB |
Output is correct |
| 25 |
Partially correct |
32 ms |
1112 KB |
Partially correct |
| 26 |
Correct |
16 ms |
1112 KB |
Output is correct |
| 27 |
Correct |
17 ms |
1064 KB |
Output is correct |
| 28 |
Correct |
24 ms |
1016 KB |
Output is correct |
| 29 |
Correct |
17 ms |
1112 KB |
Output is correct |
| 30 |
Correct |
15 ms |
1152 KB |
Output is correct |
| 31 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
