#include "gap.h"
#include <algorithm>
using namespace std;
long long a[100009]; int res = 0;
void saiki(long long L, long long R) {
long long s, t;
MinMax(L, R - 1, &s, &t);
if (s == -1) return;
if (s == t) { res++; a[res] = s; return; }
t++;
if (t - s <= 100000) {
for (int i = s; i < t; i++) {
saiki(i, i + 1);
}
}
else {
for (int i = 0; i < 100000; i++) {
long long G1 = 1LL * (t - s)*i / 100000LL; G1 += s;
long long G2 = 1LL * (t - s)*(i + 1) / 100000LL; G2 += s;
saiki(G1, G2);
}
}
}
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 |
356 KB |
Output is correct |
3 |
Correct |
2 ms |
408 KB |
Output is correct |
4 |
Correct |
1 ms |
408 KB |
Output is correct |
5 |
Correct |
2 ms |
412 KB |
Output is correct |
6 |
Correct |
2 ms |
472 KB |
Output is correct |
7 |
Correct |
2 ms |
600 KB |
Output is correct |
8 |
Correct |
2 ms |
620 KB |
Output is correct |
9 |
Correct |
2 ms |
620 KB |
Output is correct |
10 |
Correct |
2 ms |
620 KB |
Output is correct |
11 |
Correct |
2 ms |
712 KB |
Output is correct |
12 |
Correct |
3 ms |
712 KB |
Output is correct |
13 |
Correct |
2 ms |
712 KB |
Output is correct |
14 |
Correct |
3 ms |
712 KB |
Output is correct |
15 |
Correct |
2 ms |
712 KB |
Output is correct |
16 |
Correct |
15 ms |
980 KB |
Output is correct |
17 |
Correct |
15 ms |
980 KB |
Output is correct |
18 |
Correct |
18 ms |
980 KB |
Output is correct |
19 |
Correct |
15 ms |
1004 KB |
Output is correct |
20 |
Correct |
11 ms |
1004 KB |
Output is correct |
21 |
Correct |
55 ms |
2156 KB |
Output is correct |
22 |
Correct |
53 ms |
2160 KB |
Output is correct |
23 |
Correct |
55 ms |
2160 KB |
Output is correct |
24 |
Correct |
56 ms |
2160 KB |
Output is correct |
25 |
Correct |
46 ms |
2160 KB |
Output is correct |
26 |
Correct |
54 ms |
2160 KB |
Output is correct |
27 |
Correct |
57 ms |
2160 KB |
Output is correct |
28 |
Correct |
54 ms |
2160 KB |
Output is correct |
29 |
Correct |
54 ms |
2160 KB |
Output is correct |
30 |
Correct |
40 ms |
2160 KB |
Output is correct |
31 |
Correct |
2 ms |
2160 KB |
Output is correct |
32 |
Correct |
2 ms |
2160 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
2 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
3 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
4 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
5 |
Partially correct |
6 ms |
2160 KB |
Partially correct |
6 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
7 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
8 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
9 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
10 |
Partially correct |
9 ms |
2160 KB |
Partially correct |
11 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
12 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
13 |
Runtime error |
2 ms |
2160 KB |
Execution failed because the return code was nonzero |
14 |
Runtime error |
13 ms |
2160 KB |
Execution failed because the return code was nonzero |
15 |
Partially correct |
18 ms |
2160 KB |
Partially correct |
16 |
Runtime error |
25 ms |
2160 KB |
Execution failed because the return code was nonzero |
17 |
Runtime error |
24 ms |
2160 KB |
Execution failed because the return code was nonzero |
18 |
Runtime error |
8 ms |
2160 KB |
Execution failed because the return code was nonzero |
19 |
Runtime error |
9 ms |
2160 KB |
Execution failed because the return code was nonzero |
20 |
Partially correct |
36 ms |
2160 KB |
Partially correct |
21 |
Runtime error |
88 ms |
2160 KB |
Execution failed because the return code was nonzero |
22 |
Runtime error |
86 ms |
2160 KB |
Execution failed because the return code was nonzero |
23 |
Runtime error |
67 ms |
2160 KB |
Execution failed because the return code was nonzero |
24 |
Runtime error |
125 ms |
2160 KB |
Execution failed because the return code was nonzero |
25 |
Partially correct |
67 ms |
2196 KB |
Partially correct |
26 |
Runtime error |
89 ms |
2196 KB |
Execution failed because the return code was nonzero |
27 |
Runtime error |
72 ms |
2196 KB |
Execution failed because the return code was nonzero |
28 |
Runtime error |
86 ms |
2196 KB |
Execution failed because the return code was nonzero |
29 |
Runtime error |
107 ms |
2196 KB |
Execution failed because the return code was nonzero |
30 |
Partially correct |
83 ms |
2196 KB |
Partially correct |
31 |
Runtime error |
17 ms |
2196 KB |
Execution failed because the return code was nonzero |
32 |
Runtime error |
2 ms |
2196 KB |
Execution failed because the return code was nonzero |