#include "gap.h"
#include <algorithm>
#include <iostream>
using namespace std;
long long a[100009]; int res = 0;
void saiki(long long L, long long R) {
if (L >= R) return;
long long s, t;
MinMax(L, R - 1, &s, &t);
if (s == -1) return;
if (s == t) { res++; a[res] = s; return; }
t++;
long long B[31];
if (t - s >= (1LL << 60)) { for (int i = 0; i <= 8; i++) { long double V = 1.0L*i / 8.0L; B[i] = (1.0L*s*(1.0L - V) + 1.0L*t*V); } }
else { for (int i = 0; i <= 8; i++) B[i] = (s*(8LL - i) + t*i) / 8LL; }
for (int i = 0; i < 8; i++) saiki(B[i], B[i + 1]);
}
long long findGap(int T, int N)
{
if (T == 1) {
long long L = 0, R = 1000000000000000000LL, s, t, cnt = 0;
while (cnt < (N + 1) / 2) {
MinMax(L, R, &s, &t);
L = s; R = t;
if (L != -1) { a[cnt + 1] = L; a[N - cnt] = R; }
cnt++; L++; R--;
}
long long maxn = 0;
for (int i = 1; i <= N - 1; i++) maxn = max(maxn, a[i + 1] - a[i]);
return maxn;
}
if (T == 2) {
saiki(0LL, 1000000000000000001LL);
long long maxn = 0;
for (int i = 1; i <= N - 1; i++) maxn = max(maxn, a[i + 1] - a[i]);
return maxn;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
516 KB |
Output is correct |
4 |
Correct |
2 ms |
516 KB |
Output is correct |
5 |
Correct |
2 ms |
516 KB |
Output is correct |
6 |
Correct |
2 ms |
532 KB |
Output is correct |
7 |
Correct |
2 ms |
644 KB |
Output is correct |
8 |
Correct |
2 ms |
644 KB |
Output is correct |
9 |
Correct |
2 ms |
644 KB |
Output is correct |
10 |
Correct |
2 ms |
644 KB |
Output is correct |
11 |
Correct |
2 ms |
644 KB |
Output is correct |
12 |
Correct |
3 ms |
644 KB |
Output is correct |
13 |
Correct |
3 ms |
644 KB |
Output is correct |
14 |
Correct |
2 ms |
668 KB |
Output is correct |
15 |
Correct |
2 ms |
668 KB |
Output is correct |
16 |
Correct |
16 ms |
1028 KB |
Output is correct |
17 |
Correct |
14 ms |
1028 KB |
Output is correct |
18 |
Correct |
21 ms |
1128 KB |
Output is correct |
19 |
Correct |
15 ms |
1128 KB |
Output is correct |
20 |
Correct |
12 ms |
1128 KB |
Output is correct |
21 |
Correct |
55 ms |
2168 KB |
Output is correct |
22 |
Correct |
55 ms |
2168 KB |
Output is correct |
23 |
Correct |
55 ms |
2264 KB |
Output is correct |
24 |
Correct |
59 ms |
2264 KB |
Output is correct |
25 |
Correct |
47 ms |
2264 KB |
Output is correct |
26 |
Correct |
55 ms |
2264 KB |
Output is correct |
27 |
Correct |
56 ms |
2264 KB |
Output is correct |
28 |
Correct |
55 ms |
2264 KB |
Output is correct |
29 |
Correct |
56 ms |
2264 KB |
Output is correct |
30 |
Correct |
42 ms |
2264 KB |
Output is correct |
31 |
Correct |
2 ms |
2264 KB |
Output is correct |
32 |
Correct |
2 ms |
2264 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
2 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
3 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
4 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
5 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
6 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
7 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
8 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
9 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
10 |
Partially correct |
2 ms |
2264 KB |
Partially correct |
11 |
Partially correct |
4 ms |
2264 KB |
Partially correct |
12 |
Partially correct |
4 ms |
2264 KB |
Partially correct |
13 |
Partially correct |
4 ms |
2264 KB |
Partially correct |
14 |
Partially correct |
4 ms |
2264 KB |
Partially correct |
15 |
Partially correct |
4 ms |
2264 KB |
Partially correct |
16 |
Partially correct |
34 ms |
2264 KB |
Partially correct |
17 |
Partially correct |
35 ms |
2264 KB |
Partially correct |
18 |
Partially correct |
36 ms |
2264 KB |
Partially correct |
19 |
Partially correct |
34 ms |
2264 KB |
Partially correct |
20 |
Partially correct |
21 ms |
2264 KB |
Partially correct |
21 |
Partially correct |
142 ms |
2308 KB |
Partially correct |
22 |
Partially correct |
140 ms |
2308 KB |
Partially correct |
23 |
Partially correct |
147 ms |
2308 KB |
Partially correct |
24 |
Partially correct |
140 ms |
2308 KB |
Partially correct |
25 |
Partially correct |
122 ms |
2308 KB |
Partially correct |
26 |
Partially correct |
141 ms |
2308 KB |
Partially correct |
27 |
Partially correct |
149 ms |
2308 KB |
Partially correct |
28 |
Partially correct |
142 ms |
2308 KB |
Partially correct |
29 |
Partially correct |
151 ms |
2308 KB |
Partially correct |
30 |
Partially correct |
77 ms |
2308 KB |
Partially correct |
31 |
Partially correct |
2 ms |
2308 KB |
Partially correct |
32 |
Partially correct |
2 ms |
2308 KB |
Partially correct |