#include "gap.h"
#define ll long long
long long findGap(int T, int N)
{
ll l = 0;
ll r = 1e18;
ll mxdist = 0;
ll nl = 0;
ll nr = 0;
ll fl = -1;
ll fr = -1;
for (int j = 0; j < N && l<=r; j+=2)
{
MinMax(l, r, &nl, &nr);
if (nr==-1) break;
if (fl != -1 && nl-fl>mxdist) mxdist = nl-fl;
if (fr != -1 && fr-nr>mxdist) mxdist = fr-nr;
fl = nl;
fr = nr;
l = nl+1;
r = nr-1;
}
if (fr-fl>mxdist) mxdist = fr-fl;
return mxdist;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 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 |
0 ms |
344 KB |
Output is correct |
16 |
Correct |
5 ms |
416 KB |
Output is correct |
17 |
Correct |
6 ms |
600 KB |
Output is correct |
18 |
Correct |
7 ms |
808 KB |
Output is correct |
19 |
Correct |
7 ms |
600 KB |
Output is correct |
20 |
Correct |
4 ms |
600 KB |
Output is correct |
21 |
Correct |
24 ms |
1112 KB |
Output is correct |
22 |
Correct |
21 ms |
1128 KB |
Output is correct |
23 |
Correct |
24 ms |
1112 KB |
Output is correct |
24 |
Correct |
24 ms |
1112 KB |
Output is correct |
25 |
Correct |
19 ms |
1112 KB |
Output is correct |
26 |
Correct |
23 ms |
1064 KB |
Output is correct |
27 |
Correct |
25 ms |
1112 KB |
Output is correct |
28 |
Correct |
21 ms |
1208 KB |
Output is correct |
29 |
Correct |
23 ms |
1112 KB |
Output is correct |
30 |
Correct |
18 ms |
1112 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 |
Partially correct |
0 ms |
344 KB |
Partially correct |
3 |
Partially correct |
0 ms |
344 KB |
Partially correct |
4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
5 |
Partially correct |
0 ms |
344 KB |
Partially correct |
6 |
Partially correct |
0 ms |
344 KB |
Partially correct |
7 |
Partially correct |
0 ms |
344 KB |
Partially correct |
8 |
Partially correct |
0 ms |
344 KB |
Partially correct |
9 |
Partially correct |
0 ms |
344 KB |
Partially correct |
10 |
Partially correct |
0 ms |
344 KB |
Partially correct |
11 |
Partially correct |
1 ms |
344 KB |
Partially correct |
12 |
Partially correct |
0 ms |
344 KB |
Partially correct |
13 |
Partially correct |
0 ms |
344 KB |
Partially correct |
14 |
Partially correct |
0 ms |
344 KB |
Partially correct |
15 |
Partially correct |
0 ms |
344 KB |
Partially correct |
16 |
Partially correct |
5 ms |
424 KB |
Partially correct |
17 |
Partially correct |
6 ms |
600 KB |
Partially correct |
18 |
Partially correct |
6 ms |
460 KB |
Partially correct |
19 |
Partially correct |
5 ms |
600 KB |
Partially correct |
20 |
Partially correct |
4 ms |
632 KB |
Partially correct |
21 |
Incorrect |
23 ms |
1188 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
31 ms |
1180 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
23 ms |
1112 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
33 ms |
1112 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
20 ms |
1112 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
23 ms |
1112 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
21 ms |
1112 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
22 ms |
1112 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
23 ms |
1096 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
17 ms |
1112 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
0 ms |
344 KB |
Partially correct |
32 |
Partially correct |
0 ms |
344 KB |
Partially correct |