#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int N)
{
long long mn, mx, mmn, mmx;
MinMax(0, 2e18, &mn, &mx);
long long res = 0;
if (T == 1)
{
for (int i = 1; i < (N+1)/2; i++)
{
MinMax(mn+1, mx-1, &mmn, &mmx);
if (mmn == -1) break;
res = max({res, mmn-mn, mx-mmx});
mn = mmn;
mx = mmx;
}
res = max(res, mx - mn);
}
else
{
long long sz = (mx - mn + N - 1)/N;
long long last = mn;
for (long long b = mn+1, e = mn+sz; ; b += sz, e += sz)
{
if (e >= mx) e = mx - 1;
if (b > e) break;
MinMax(b, e, &mmn, &mmx);
if (mmn == -1) continue;
res = max(res, mmn - last);
last = mmx;
}
res = max(res, mx - last);
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
488 KB |
Output is correct |
3 |
Correct |
2 ms |
488 KB |
Output is correct |
4 |
Correct |
2 ms |
488 KB |
Output is correct |
5 |
Correct |
2 ms |
488 KB |
Output is correct |
6 |
Correct |
2 ms |
488 KB |
Output is correct |
7 |
Correct |
2 ms |
648 KB |
Output is correct |
8 |
Correct |
2 ms |
648 KB |
Output is correct |
9 |
Correct |
2 ms |
648 KB |
Output is correct |
10 |
Correct |
2 ms |
648 KB |
Output is correct |
11 |
Correct |
2 ms |
696 KB |
Output is correct |
12 |
Correct |
3 ms |
696 KB |
Output is correct |
13 |
Correct |
3 ms |
696 KB |
Output is correct |
14 |
Correct |
2 ms |
696 KB |
Output is correct |
15 |
Correct |
2 ms |
696 KB |
Output is correct |
16 |
Correct |
14 ms |
716 KB |
Output is correct |
17 |
Correct |
14 ms |
796 KB |
Output is correct |
18 |
Correct |
14 ms |
840 KB |
Output is correct |
19 |
Correct |
14 ms |
840 KB |
Output is correct |
20 |
Correct |
11 ms |
896 KB |
Output is correct |
21 |
Correct |
52 ms |
1356 KB |
Output is correct |
22 |
Correct |
52 ms |
1356 KB |
Output is correct |
23 |
Correct |
52 ms |
1356 KB |
Output is correct |
24 |
Correct |
53 ms |
1356 KB |
Output is correct |
25 |
Correct |
44 ms |
1456 KB |
Output is correct |
26 |
Correct |
52 ms |
1456 KB |
Output is correct |
27 |
Correct |
53 ms |
1456 KB |
Output is correct |
28 |
Correct |
53 ms |
1484 KB |
Output is correct |
29 |
Correct |
52 ms |
1484 KB |
Output is correct |
30 |
Correct |
38 ms |
1484 KB |
Output is correct |
31 |
Correct |
2 ms |
1484 KB |
Output is correct |
32 |
Correct |
2 ms |
1484 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1484 KB |
Output is correct |
2 |
Correct |
2 ms |
1484 KB |
Output is correct |
3 |
Correct |
2 ms |
1484 KB |
Output is correct |
4 |
Correct |
2 ms |
1484 KB |
Output is correct |
5 |
Correct |
2 ms |
1484 KB |
Output is correct |
6 |
Correct |
2 ms |
1484 KB |
Output is correct |
7 |
Correct |
2 ms |
1484 KB |
Output is correct |
8 |
Correct |
2 ms |
1484 KB |
Output is correct |
9 |
Correct |
2 ms |
1484 KB |
Output is correct |
10 |
Correct |
2 ms |
1484 KB |
Output is correct |
11 |
Correct |
3 ms |
1484 KB |
Output is correct |
12 |
Correct |
3 ms |
1484 KB |
Output is correct |
13 |
Correct |
2 ms |
1484 KB |
Output is correct |
14 |
Correct |
3 ms |
1484 KB |
Output is correct |
15 |
Correct |
3 ms |
1484 KB |
Output is correct |
16 |
Correct |
18 ms |
1484 KB |
Output is correct |
17 |
Correct |
19 ms |
1484 KB |
Output is correct |
18 |
Correct |
18 ms |
1484 KB |
Output is correct |
19 |
Correct |
18 ms |
1484 KB |
Output is correct |
20 |
Correct |
9 ms |
1484 KB |
Output is correct |
21 |
Correct |
71 ms |
1532 KB |
Output is correct |
22 |
Correct |
71 ms |
1532 KB |
Output is correct |
23 |
Correct |
71 ms |
1532 KB |
Output is correct |
24 |
Correct |
71 ms |
1532 KB |
Output is correct |
25 |
Correct |
65 ms |
1536 KB |
Output is correct |
26 |
Correct |
72 ms |
1536 KB |
Output is correct |
27 |
Correct |
71 ms |
1536 KB |
Output is correct |
28 |
Correct |
74 ms |
1536 KB |
Output is correct |
29 |
Correct |
72 ms |
1536 KB |
Output is correct |
30 |
Correct |
39 ms |
1536 KB |
Output is correct |
31 |
Correct |
2 ms |
1536 KB |
Output is correct |
32 |
Correct |
2 ms |
1536 KB |
Output is correct |