#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;
t=a;
for(;a<=b;a+=x)
{
l=a;
r=min(b,a+x);
MinMax(l,r,&c,&d);
ans=max(ans,d-c);
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 |
2 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 |
412 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
9 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
10 |
Incorrect |
2 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 |
4 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 |
512 KB |
Output isn't correct |
17 |
Incorrect |
18 ms |
512 KB |
Output isn't correct |
18 |
Incorrect |
25 ms |
512 KB |
Output isn't correct |
19 |
Incorrect |
18 ms |
484 KB |
Output isn't correct |
20 |
Incorrect |
8 ms |
512 KB |
Output isn't correct |
21 |
Incorrect |
69 ms |
1144 KB |
Output isn't correct |
22 |
Incorrect |
72 ms |
1152 KB |
Output isn't correct |
23 |
Incorrect |
94 ms |
1116 KB |
Output isn't correct |
24 |
Incorrect |
69 ms |
1144 KB |
Output isn't correct |
25 |
Incorrect |
68 ms |
1144 KB |
Output isn't correct |
26 |
Incorrect |
62 ms |
1144 KB |
Output isn't correct |
27 |
Incorrect |
63 ms |
1144 KB |
Output isn't correct |
28 |
Incorrect |
70 ms |
1144 KB |
Output isn't correct |
29 |
Incorrect |
64 ms |
1272 KB |
Output isn't correct |
30 |
Incorrect |
32 ms |
1152 KB |
Output isn't correct |
31 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2 ms |
460 KB |
Partially correct |
2 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
3 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
4 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
5 |
Partially correct |
3 ms |
384 KB |
Partially correct |
6 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
2 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 |
4 ms |
384 KB |
Output isn't correct |
12 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
15 |
Partially correct |
3 ms |
384 KB |
Partially correct |
16 |
Incorrect |
18 ms |
512 KB |
Output isn't correct |
17 |
Incorrect |
19 ms |
512 KB |
Output isn't correct |
18 |
Incorrect |
21 ms |
512 KB |
Output isn't correct |
19 |
Incorrect |
24 ms |
512 KB |
Output isn't correct |
20 |
Incorrect |
11 ms |
512 KB |
Output isn't correct |
21 |
Incorrect |
77 ms |
1272 KB |
Output isn't correct |
22 |
Incorrect |
74 ms |
1152 KB |
Output isn't correct |
23 |
Incorrect |
82 ms |
1144 KB |
Output isn't correct |
24 |
Incorrect |
72 ms |
1060 KB |
Output isn't correct |
25 |
Partially correct |
67 ms |
1200 KB |
Partially correct |
26 |
Incorrect |
97 ms |
1144 KB |
Output isn't correct |
27 |
Incorrect |
63 ms |
1192 KB |
Output isn't correct |
28 |
Incorrect |
65 ms |
1272 KB |
Output isn't correct |
29 |
Incorrect |
68 ms |
1156 KB |
Output isn't correct |
30 |
Incorrect |
33 ms |
1152 KB |
Output isn't correct |
31 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |