#include <iostream>
#include <algorithm>
#include "gap.h"
using namespace std;
long long findGap(int T,int N)
{
long long a,b,l=0,r=N-1,x=0,y=1000000000000000000 ,ans=0,c,d,t;
MinMax(x,y,&a,&b);
x=(b-a)/(N-1)+1;
t=a;
for(;a<=b;a+=x)
{
l=a;
r=min(b,a+x);
MinMax(l,r,&c,&d);
ans=max(ans,d-c);
if(c!=-1)
{
ans=max(ans,c-t);
t=d;
}
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 4 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 6 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 8 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 10 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 11 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 12 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 14 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 15 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 16 |
Incorrect |
19 ms |
632 KB |
Output isn't correct |
| 17 |
Incorrect |
17 ms |
512 KB |
Output isn't correct |
| 18 |
Incorrect |
17 ms |
512 KB |
Output isn't correct |
| 19 |
Incorrect |
17 ms |
512 KB |
Output isn't correct |
| 20 |
Incorrect |
8 ms |
512 KB |
Output isn't correct |
| 21 |
Incorrect |
72 ms |
1272 KB |
Output isn't correct |
| 22 |
Incorrect |
75 ms |
1228 KB |
Output isn't correct |
| 23 |
Incorrect |
66 ms |
1144 KB |
Output isn't correct |
| 24 |
Incorrect |
65 ms |
1152 KB |
Output isn't correct |
| 25 |
Incorrect |
74 ms |
1160 KB |
Output isn't correct |
| 26 |
Incorrect |
71 ms |
1144 KB |
Output isn't correct |
| 27 |
Incorrect |
70 ms |
1196 KB |
Output isn't correct |
| 28 |
Incorrect |
67 ms |
1152 KB |
Output isn't correct |
| 29 |
Incorrect |
70 ms |
1144 KB |
Output isn't correct |
| 30 |
Incorrect |
35 ms |
1152 KB |
Output isn't correct |
| 31 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 32 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
3 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
356 KB |
Output is correct |
| 13 |
Correct |
4 ms |
384 KB |
Output is correct |
| 14 |
Correct |
3 ms |
384 KB |
Output is correct |
| 15 |
Correct |
0 ms |
384 KB |
Output is correct |
| 16 |
Correct |
23 ms |
512 KB |
Output is correct |
| 17 |
Correct |
21 ms |
512 KB |
Output is correct |
| 18 |
Correct |
20 ms |
512 KB |
Output is correct |
| 19 |
Correct |
21 ms |
512 KB |
Output is correct |
| 20 |
Partially correct |
15 ms |
512 KB |
Partially correct |
| 21 |
Correct |
73 ms |
1144 KB |
Output is correct |
| 22 |
Correct |
70 ms |
1200 KB |
Output is correct |
| 23 |
Correct |
81 ms |
1144 KB |
Output is correct |
| 24 |
Correct |
71 ms |
1144 KB |
Output is correct |
| 25 |
Correct |
62 ms |
1144 KB |
Output is correct |
| 26 |
Correct |
76 ms |
1144 KB |
Output is correct |
| 27 |
Correct |
75 ms |
1164 KB |
Output is correct |
| 28 |
Correct |
78 ms |
1116 KB |
Output is correct |
| 29 |
Correct |
70 ms |
1124 KB |
Output is correct |
| 30 |
Partially correct |
32 ms |
1140 KB |
Partially correct |
| 31 |
Correct |
2 ms |
384 KB |
Output is correct |
| 32 |
Correct |
2 ms |
384 KB |
Output is correct |
