#include "gap.h"
long long findGap(int t, int n)
{
if(t==2)
{
long long mn,mx;
MinMax(-1e18,1e18,&mn,&mx);
long long k=mx-mn;
long long x = (k+n-1)/n;
long long z=x,l=mn,ll=l;
while(l<mx)
{
long long p,q;
MinMax(l+1,l+x,&p,&q);
if(~p)
{
if(p-ll>z)z=p-ll;
ll=q;
l+=x;
}
else
{
l+=x;
}
}
return z;
}
else
{
long long mn,mx;
MinMax(-1e18,1e18,&mn,&mx);
int found;
if(mn==mx)found=1; else found=2;
long long z=0;
if(found==n)z=mx-mn;
while(found<n&&mx-mn>1)
{
long long p,q;
MinMax(mn+1,mx-1,&p,&q);
if(p==q)++found;
else found+=2;
if(found==n)
if(q-p>z)z=q-p;
if(~p)
{
if(p-mn>z)z=p-mn;
if(mx-q>z)z=mx-q;
mn=p,mx=q;
}
else
{
if(mx-mn>z)z=mx-mn;
break;
}
}
return z;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is 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 |
1 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 |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
7 ms |
800 KB |
Output is correct |
17 |
Correct |
9 ms |
600 KB |
Output is correct |
18 |
Correct |
7 ms |
624 KB |
Output is correct |
19 |
Correct |
8 ms |
616 KB |
Output is correct |
20 |
Correct |
6 ms |
600 KB |
Output is correct |
21 |
Correct |
31 ms |
1436 KB |
Output is correct |
22 |
Correct |
27 ms |
1188 KB |
Output is correct |
23 |
Correct |
28 ms |
1188 KB |
Output is correct |
24 |
Correct |
30 ms |
1104 KB |
Output is correct |
25 |
Correct |
24 ms |
1172 KB |
Output is correct |
26 |
Correct |
27 ms |
1196 KB |
Output is correct |
27 |
Correct |
27 ms |
1184 KB |
Output is correct |
28 |
Correct |
27 ms |
1208 KB |
Output is correct |
29 |
Correct |
27 ms |
1188 KB |
Output is correct |
30 |
Correct |
27 ms |
1184 KB |
Output is correct |
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 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is 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 |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 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 |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
10 ms |
800 KB |
Output is correct |
17 |
Correct |
13 ms |
612 KB |
Output is correct |
18 |
Correct |
11 ms |
620 KB |
Output is correct |
19 |
Correct |
9 ms |
616 KB |
Output is correct |
20 |
Correct |
5 ms |
588 KB |
Output is correct |
21 |
Correct |
39 ms |
1208 KB |
Output is correct |
22 |
Correct |
46 ms |
1112 KB |
Output is correct |
23 |
Correct |
48 ms |
1104 KB |
Output is correct |
24 |
Correct |
38 ms |
1208 KB |
Output is correct |
25 |
Correct |
39 ms |
1188 KB |
Output is correct |
26 |
Correct |
39 ms |
1188 KB |
Output is correct |
27 |
Correct |
45 ms |
1192 KB |
Output is correct |
28 |
Correct |
40 ms |
1180 KB |
Output is correct |
29 |
Correct |
39 ms |
1188 KB |
Output is correct |
30 |
Correct |
25 ms |
1152 KB |
Output is correct |
31 |
Correct |
1 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |