#include "gap.h"
#include <iostream>
#include <climits>
using namespace std;
const int nmax=100005;
long long v[nmax];
long long mx,st,dr,act,len,oldlen,inf,sup;
int n,i;
long long findGap(int T, int N)
{
n=N;
if(T==1)
{
mx=0;
v[0]=-1;v[n+1]=1LL*1e18+1;
for(i=1;i<=n/2;i++)
{
MinMax(v[i-1]+1,v[n-i+2]-1,&v[i],&v[n-i+1]);
}
if((n&1))
{
MinMax(v[n/2]+1,v[n/2+2]-1,&v[(n+1)/2],&sup);
}
for(i=1;i<n;i++)
mx=max(mx,v[i+1]-v[i]);
return mx;
}
act=-1;len=1;oldlen=1;
bool bun=1;
MinMax(0,1LL*1e18,&inf,&sup);
long long nn=n,ans=0;
long long def=(sup-inf)/(nn-1);
if((inf-sup)%(nn-1))
def++;
act=inf;
for(long long i=1;i<=n&&i<=LLONG_MAX/def;i++)
{
bool ok=1;
while(ok&&i*def<=LLONG_MAX-act&&act+1LL*(i-1)*def<=sup)
{
ok=0;
if(act!=-1)oldlen=len;
MinMax(act+1,act+1LL*i*def,&st,&dr);
if(dr!=-1)
{
ans=max(st-act,ans);
act=dr;
ok=1;
}
}
}
return ans;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:29:10: warning: unused variable 'bun' [-Wunused-variable]
bool bun=1;
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
372 KB |
Output is correct |
| 3 |
Correct |
2 ms |
576 KB |
Output is correct |
| 4 |
Correct |
2 ms |
576 KB |
Output is correct |
| 5 |
Correct |
2 ms |
576 KB |
Output is correct |
| 6 |
Correct |
2 ms |
592 KB |
Output is correct |
| 7 |
Correct |
2 ms |
656 KB |
Output is correct |
| 8 |
Correct |
3 ms |
664 KB |
Output is correct |
| 9 |
Correct |
2 ms |
664 KB |
Output is correct |
| 10 |
Correct |
2 ms |
664 KB |
Output is correct |
| 11 |
Correct |
3 ms |
664 KB |
Output is correct |
| 12 |
Correct |
3 ms |
664 KB |
Output is correct |
| 13 |
Correct |
3 ms |
664 KB |
Output is correct |
| 14 |
Correct |
3 ms |
664 KB |
Output is correct |
| 15 |
Correct |
2 ms |
704 KB |
Output is correct |
| 16 |
Correct |
16 ms |
1004 KB |
Output is correct |
| 17 |
Correct |
16 ms |
1004 KB |
Output is correct |
| 18 |
Correct |
15 ms |
1004 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1004 KB |
Output is correct |
| 20 |
Correct |
11 ms |
1004 KB |
Output is correct |
| 21 |
Correct |
58 ms |
2120 KB |
Output is correct |
| 22 |
Correct |
56 ms |
2188 KB |
Output is correct |
| 23 |
Correct |
57 ms |
2188 KB |
Output is correct |
| 24 |
Correct |
56 ms |
2188 KB |
Output is correct |
| 25 |
Correct |
47 ms |
2188 KB |
Output is correct |
| 26 |
Correct |
55 ms |
2188 KB |
Output is correct |
| 27 |
Correct |
58 ms |
2188 KB |
Output is correct |
| 28 |
Correct |
55 ms |
2188 KB |
Output is correct |
| 29 |
Correct |
58 ms |
2188 KB |
Output is correct |
| 30 |
Correct |
44 ms |
2284 KB |
Output is correct |
| 31 |
Incorrect |
2 ms |
2284 KB |
Output isn't correct |
| 32 |
Correct |
2 ms |
2284 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
2284 KB |
Output isn't correct |
| 4 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 11 |
Correct |
3 ms |
2284 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2284 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2284 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2284 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2284 KB |
Output is correct |
| 16 |
Correct |
11 ms |
2284 KB |
Output is correct |
| 17 |
Correct |
11 ms |
2284 KB |
Output is correct |
| 18 |
Correct |
11 ms |
2284 KB |
Output is correct |
| 19 |
Correct |
12 ms |
2284 KB |
Output is correct |
| 20 |
Correct |
8 ms |
2284 KB |
Output is correct |
| 21 |
Correct |
39 ms |
2284 KB |
Output is correct |
| 22 |
Correct |
38 ms |
2284 KB |
Output is correct |
| 23 |
Correct |
36 ms |
2284 KB |
Output is correct |
| 24 |
Correct |
37 ms |
2284 KB |
Output is correct |
| 25 |
Correct |
69 ms |
2284 KB |
Output is correct |
| 26 |
Correct |
36 ms |
2284 KB |
Output is correct |
| 27 |
Correct |
37 ms |
2284 KB |
Output is correct |
| 28 |
Correct |
37 ms |
2284 KB |
Output is correct |
| 29 |
Correct |
37 ms |
2284 KB |
Output is correct |
| 30 |
Correct |
27 ms |
2284 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2284 KB |
Output is correct |
