#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll =long long;
ll Sub1(ll N) {
ll b[N + 2],ans, lo1, hi1, lo, hi, l, r;
l = 1;
r = N;
lo = 0;
hi = 1e18;
while ( l <= r) {
MinMax(lo, hi, &lo1, &hi1);
if (lo1 == -1) break;
b[l] = lo1;
b[r] = hi1;
lo = lo1 + 1;
hi = hi1 - 1;
l ++;
r --;
}
ans = 0;
for (int i = 2; i <= N; i ++) {
ans =max(ans, b[i] - b[i - 1]);
}
return ans;
}
ll Sub2(ll N) {
return N;
}
long long findGap(int T, int N) {
if ( T == 1) {
return Sub1(N);
}
else return Sub2(N);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
2392 KB |
Output is correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
1 ms |
2392 KB |
Output is correct |
5 |
Correct |
0 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
0 ms |
2392 KB |
Output is correct |
9 |
Correct |
1 ms |
2644 KB |
Output is correct |
10 |
Correct |
1 ms |
2392 KB |
Output is correct |
11 |
Correct |
1 ms |
2392 KB |
Output is correct |
12 |
Correct |
1 ms |
2392 KB |
Output is correct |
13 |
Correct |
1 ms |
2392 KB |
Output is correct |
14 |
Correct |
1 ms |
2392 KB |
Output is correct |
15 |
Correct |
1 ms |
2392 KB |
Output is correct |
16 |
Correct |
8 ms |
2588 KB |
Output is correct |
17 |
Correct |
8 ms |
2588 KB |
Output is correct |
18 |
Correct |
7 ms |
2588 KB |
Output is correct |
19 |
Correct |
7 ms |
2588 KB |
Output is correct |
20 |
Correct |
6 ms |
2820 KB |
Output is correct |
21 |
Correct |
27 ms |
3636 KB |
Output is correct |
22 |
Correct |
27 ms |
3628 KB |
Output is correct |
23 |
Correct |
28 ms |
3632 KB |
Output is correct |
24 |
Correct |
28 ms |
3624 KB |
Output is correct |
25 |
Correct |
26 ms |
3616 KB |
Output is correct |
26 |
Correct |
28 ms |
3628 KB |
Output is correct |
27 |
Correct |
28 ms |
3644 KB |
Output is correct |
28 |
Correct |
27 ms |
3628 KB |
Output is correct |
29 |
Correct |
27 ms |
3624 KB |
Output is correct |
30 |
Correct |
23 ms |
3616 KB |
Output is correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
16 |
Incorrect |
3 ms |
2740 KB |
Output isn't correct |
17 |
Incorrect |
4 ms |
2824 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
2584 KB |
Output isn't correct |
19 |
Incorrect |
3 ms |
2736 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
2572 KB |
Output isn't correct |
21 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
22 |
Incorrect |
12 ms |
2860 KB |
Output isn't correct |
23 |
Incorrect |
13 ms |
2852 KB |
Output isn't correct |
24 |
Incorrect |
12 ms |
2904 KB |
Output isn't correct |
25 |
Incorrect |
10 ms |
2848 KB |
Output isn't correct |
26 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
27 |
Incorrect |
12 ms |
2864 KB |
Output isn't correct |
28 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
29 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
30 |
Incorrect |
7 ms |
2856 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |