#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);
long long z=0;
while(mx-mn>1)
{
long long p,q;
MinMax(mn+1,mx-1,&p,&q);
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,mx=mn;
else mx=mn;
}
return z;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
352 KB |
Output isn't correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is 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 |
1 ms |
344 KB |
Output isn't correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Incorrect |
1 ms |
344 KB |
Output isn't 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 |
448 KB |
Output isn't correct |
16 |
Incorrect |
8 ms |
612 KB |
Output isn't correct |
17 |
Incorrect |
10 ms |
616 KB |
Output isn't correct |
18 |
Incorrect |
7 ms |
616 KB |
Output isn't correct |
19 |
Incorrect |
7 ms |
616 KB |
Output isn't correct |
20 |
Correct |
8 ms |
596 KB |
Output is correct |
21 |
Incorrect |
27 ms |
1188 KB |
Output isn't correct |
22 |
Incorrect |
27 ms |
1184 KB |
Output isn't correct |
23 |
Incorrect |
28 ms |
1436 KB |
Output isn't correct |
24 |
Incorrect |
35 ms |
1080 KB |
Output isn't correct |
25 |
Incorrect |
24 ms |
1172 KB |
Output isn't correct |
26 |
Incorrect |
27 ms |
1188 KB |
Output isn't correct |
27 |
Incorrect |
27 ms |
1188 KB |
Output isn't correct |
28 |
Incorrect |
29 ms |
1188 KB |
Output isn't correct |
29 |
Incorrect |
39 ms |
1188 KB |
Output isn't correct |
30 |
Correct |
31 ms |
1172 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 |
1 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 |
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 |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
9 ms |
800 KB |
Output is correct |
17 |
Correct |
13 ms |
480 KB |
Output is correct |
18 |
Correct |
9 ms |
628 KB |
Output is correct |
19 |
Correct |
14 ms |
628 KB |
Output is correct |
20 |
Correct |
5 ms |
592 KB |
Output is correct |
21 |
Correct |
53 ms |
1192 KB |
Output is correct |
22 |
Correct |
38 ms |
1164 KB |
Output is correct |
23 |
Correct |
38 ms |
1188 KB |
Output is correct |
24 |
Correct |
39 ms |
1196 KB |
Output is correct |
25 |
Correct |
38 ms |
1172 KB |
Output is correct |
26 |
Correct |
54 ms |
1052 KB |
Output is correct |
27 |
Correct |
39 ms |
1208 KB |
Output is correct |
28 |
Correct |
42 ms |
1204 KB |
Output is correct |
29 |
Correct |
38 ms |
1192 KB |
Output is correct |
30 |
Correct |
22 ms |
1168 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |