#include "gap.h"
#include <algorithm>
using namespace std;
long long a[100009];
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) {
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;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
484 KB |
Output is correct |
| 3 |
Correct |
2 ms |
484 KB |
Output is correct |
| 4 |
Correct |
2 ms |
484 KB |
Output is correct |
| 5 |
Correct |
2 ms |
540 KB |
Output is correct |
| 6 |
Correct |
2 ms |
572 KB |
Output is correct |
| 7 |
Correct |
2 ms |
576 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 |
628 KB |
Output is correct |
| 11 |
Correct |
2 ms |
636 KB |
Output is correct |
| 12 |
Correct |
2 ms |
636 KB |
Output is correct |
| 13 |
Correct |
2 ms |
636 KB |
Output is correct |
| 14 |
Correct |
2 ms |
636 KB |
Output is correct |
| 15 |
Correct |
3 ms |
636 KB |
Output is correct |
| 16 |
Correct |
15 ms |
892 KB |
Output is correct |
| 17 |
Correct |
15 ms |
892 KB |
Output is correct |
| 18 |
Correct |
15 ms |
1020 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1020 KB |
Output is correct |
| 20 |
Correct |
13 ms |
1020 KB |
Output is correct |
| 21 |
Correct |
56 ms |
2172 KB |
Output is correct |
| 22 |
Correct |
58 ms |
2176 KB |
Output is correct |
| 23 |
Correct |
59 ms |
2176 KB |
Output is correct |
| 24 |
Correct |
57 ms |
2236 KB |
Output is correct |
| 25 |
Correct |
48 ms |
2236 KB |
Output is correct |
| 26 |
Correct |
56 ms |
2236 KB |
Output is correct |
| 27 |
Correct |
57 ms |
2280 KB |
Output is correct |
| 28 |
Correct |
56 ms |
2280 KB |
Output is correct |
| 29 |
Correct |
56 ms |
2280 KB |
Output is correct |
| 30 |
Correct |
42 ms |
2280 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2280 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2280 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2280 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 10 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 11 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 12 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 13 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 14 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 15 |
Partially correct |
2 ms |
2280 KB |
Partially correct |
| 16 |
Partially correct |
15 ms |
2280 KB |
Partially correct |
| 17 |
Partially correct |
15 ms |
2280 KB |
Partially correct |
| 18 |
Partially correct |
15 ms |
2280 KB |
Partially correct |
| 19 |
Partially correct |
15 ms |
2280 KB |
Partially correct |
| 20 |
Partially correct |
11 ms |
2280 KB |
Partially correct |
| 21 |
Incorrect |
56 ms |
2280 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
58 ms |
2280 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
56 ms |
2280 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
58 ms |
2280 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
54 ms |
2280 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
56 ms |
2300 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
61 ms |
2300 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
59 ms |
2300 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
60 ms |
2300 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
48 ms |
2300 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
2 ms |
2300 KB |
Partially correct |
| 32 |
Partially correct |
2 ms |
2300 KB |
Partially correct |
