#include "gap.h"
#define SZ 100005
#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
ll n, x = -1, num = 1e18 + 5, a[SZ];
vector<ll> b;
void f(ll p, ll q) {
ll mn1, mx1, mn2, mx2;
mn1 = mx1 = mn2 = mx2 = -1;
if (p > q || b.size() == n || q - p <= x) return;
if (q - p <= num) {
MinMax(p, q, &mn1, &mx1);
if (mn1 == -1) return;
b.push_back(mn1);
if (mn1 != mx1) b.push_back(mx1);
f(mn1 + 1, mx1 - 1);
} else {
ll md = (p + q) / 2;
MinMax(p, md, &mn1, &mx1);
if (p < q) MinMax(md + 1, q, &mn2, &mx2);
if (mn1 == -1 && mx1 == -1 && mn2 == -1 && mx2 == -1) x = max(x, (q + 1) - (p - 1));
if (mn1 != -1) {
b.push_back(mn1);
if (mn1 != mx1) b.push_back(mx1);
f(mn1 + 1, mx1 - 1);
}
if (p < q && mn2 != -1) {
b.push_back(mn2);
if (mn2 != mx2) b.push_back(mx2);
f(mn2 + 1, mx2 - 1);
}
}
}
long long findGap(int T, int N)
{
ll st = 0, en = 1e18, i = 0, j = N - 1, mn, mx, ans;
n = N;
if (T == 1) {
while (i <= j) {
MinMax(st, en, &mn, &mx);
a[i] = mn;
a[j] = mx;
st = mn + 1;
en = mx - 1;
i++;
j--;
}
ans = a[1] - a[0];
for (i = 1; i < N - 1; i++) {
ans = max(ans, a[i + 1] - a[i]);
}
} else {
MinMax(st, en, &mn, &mx);
b.push_back(mn);
b.push_back(mx);
x = (mx - mn) / (N - 1);
if ((mx - mn) % (N - 1) > 0) x++;
f(mn + 1, mx - 1);
sort(b.begin(), b.end());
ans = x;
for (i = 0; i < b.size() - 1; i++) {
ans = max(ans, b[i + 1] - b[i]);
}
}
return ans;
}
Compilation message
gap.cpp: In function 'void f(ll, ll)':
gap.cpp:15:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (p > q || b.size() == n || q - p <= x) return;
^
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:67:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < b.size() - 1; i++) {
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5928 KB |
Output is correct |
| 17 |
Correct |
19 ms |
5928 KB |
Output is correct |
| 18 |
Correct |
16 ms |
5928 KB |
Output is correct |
| 19 |
Correct |
16 ms |
5928 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5928 KB |
Output is correct |
| 21 |
Correct |
69 ms |
5928 KB |
Output is correct |
| 22 |
Correct |
46 ms |
5928 KB |
Output is correct |
| 23 |
Correct |
56 ms |
5928 KB |
Output is correct |
| 24 |
Correct |
46 ms |
5928 KB |
Output is correct |
| 25 |
Correct |
43 ms |
5928 KB |
Output is correct |
| 26 |
Correct |
46 ms |
5928 KB |
Output is correct |
| 27 |
Correct |
59 ms |
5928 KB |
Output is correct |
| 28 |
Correct |
56 ms |
5928 KB |
Output is correct |
| 29 |
Correct |
59 ms |
5928 KB |
Output is correct |
| 30 |
Correct |
43 ms |
5928 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5928 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 11 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 12 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 13 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 15 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 16 |
Partially correct |
13 ms |
7316 KB |
Partially correct |
| 17 |
Partially correct |
9 ms |
7312 KB |
Partially correct |
| 18 |
Partially correct |
13 ms |
7316 KB |
Partially correct |
| 19 |
Partially correct |
6 ms |
7316 KB |
Partially correct |
| 20 |
Partially correct |
13 ms |
7316 KB |
Partially correct |
| 21 |
Incorrect |
79 ms |
11596 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
63 ms |
11600 KB |
Expected int32, but "2500099997" found |
| 23 |
Incorrect |
63 ms |
11600 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
63 ms |
11596 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
56 ms |
11600 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
56 ms |
11600 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
76 ms |
11600 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
63 ms |
11596 KB |
Expected int32, but "2500099997" found |
| 29 |
Incorrect |
73 ms |
11600 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
53 ms |
11600 KB |
Expected int32, but "2500099952" found |
| 31 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
