#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll findGap1(int N) {
ll l = 1, r = N;
ll fl = LLONG_MIN, fr = LLONG_MAX;
ll arr[N+1];
while (l <= r) {
ll *q1 = new ll(0), *q2 = new ll(0);
MinMax(fl, fr, q1, q2);
arr[l++] = *q1;
arr[r--] = *q2;
fl = *q1+1;
fr = *q2-1;
}
ll ans = 0;
for (ll i = 1; i < N; i++) ans = max(ans, arr[i+1] - arr[i]);
return ans;
}
void query(ll s, ll t, ll &q1, ll &q2) {
ll *qr1 = new ll(0), *qr2 = new ll(0);
MinMax(s, t, qr1, qr2);
q1 = *qr1;
q2 = *qr2;
}
const ll DV = 5;
void rec(set<ll> &dt, ll l, ll r) {
if (l > r) return;
ll q1, q2;
query(l, r, q1, q2);
if (q1 == -1) return;
dt.insert(q1);
dt.insert(q2);
ll mid = (q1+q2)/2;
rec(dt, q1+1, q1 + (q2-q1+1)/DV);
for (ll i = 1; i < DV-1; i++) rec(dt, q1 + i*(q2-q1+1)/DV + 1, q1 + (i+1)*(q2-q1+1)/DV);
rec(dt, q1 + (DV-1)*(q2-q1+1)/DV + 1, q2-1);
}
ll findGap2(int N) {
set<ll> dt;
rec(dt, -2e18, 2e18);
vector<ll> arr;
for (ll i : dt) arr.push_back(i);
ll ans = 0;
for (ll i = 0; i < N-1; i++) ans = max(ans, arr[i+1] - arr[i]);
return ans;
}
ll findGap2_(int N) {
ll mi, mx;
query(LLONG_MIN, LLONG_MAX, mi, mx);
ll ans = (mx-mi+N-2)/(N-1); // by pigeonhole
ll lst = mi, lft = N;
while (lst < mx && lft > 0) {
ll q1, q2;
query(lst+1, lst+ans, q1, q2);
if (q1 == -1) {
ll cq1, cq2;
query(lst+1, mx-1, cq1, cq2);
if (cq1 == -1) {
ans = max(ans, mx-lst);
lst = mx;
lft = 0;
} else {
ans = max({ans, cq1-lst, mx-cq2});
lst = cq1;
mx = cq2;
lft -= 2;
}
} else {
lst = q2;
lft--;
}
if (lft > 1) ans = max(ans, (mx-lst+lft-2)/(lft-1));
}
return ans;
}
ll findGap(int T, int N) {
if (T == 1) return findGap1(N);
if (N <= 8) return findGap1(N);
//if (N <= 200) return findGap2_(N);
return findGap2_(N);
}
Compilation message
gap.cpp: In function 'void rec(std::set<long long int>&, ll, ll)':
gap.cpp:41:5: warning: unused variable 'mid' [-Wunused-variable]
41 | ll mid = (q1+q2)/2;
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2644 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2388 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 |
7 ms |
3668 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3416 KB |
Output is correct |
| 18 |
Correct |
9 ms |
3504 KB |
Output is correct |
| 19 |
Correct |
7 ms |
3416 KB |
Output is correct |
| 20 |
Correct |
6 ms |
3560 KB |
Output is correct |
| 21 |
Correct |
27 ms |
6736 KB |
Output is correct |
| 22 |
Correct |
27 ms |
6736 KB |
Output is correct |
| 23 |
Correct |
27 ms |
6736 KB |
Output is correct |
| 24 |
Correct |
27 ms |
6740 KB |
Output is correct |
| 25 |
Correct |
25 ms |
6744 KB |
Output is correct |
| 26 |
Correct |
36 ms |
6636 KB |
Output is correct |
| 27 |
Correct |
28 ms |
6732 KB |
Output is correct |
| 28 |
Correct |
36 ms |
6736 KB |
Output is correct |
| 29 |
Correct |
27 ms |
6740 KB |
Output is correct |
| 30 |
Correct |
28 ms |
6744 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 10 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
2488 KB |
Partially correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Partially correct |
5 ms |
2648 KB |
Partially correct |
| 17 |
Partially correct |
4 ms |
2584 KB |
Partially correct |
| 18 |
Partially correct |
4 ms |
2648 KB |
Partially correct |
| 19 |
Partially correct |
5 ms |
2648 KB |
Partially correct |
| 20 |
Partially correct |
2 ms |
2392 KB |
Partially correct |
| 21 |
Partially correct |
16 ms |
3252 KB |
Partially correct |
| 22 |
Partially correct |
17 ms |
3416 KB |
Partially correct |
| 23 |
Partially correct |
17 ms |
3416 KB |
Partially correct |
| 24 |
Partially correct |
17 ms |
3416 KB |
Partially correct |
| 25 |
Correct |
38 ms |
8880 KB |
Output is correct |
| 26 |
Partially correct |
17 ms |
3396 KB |
Partially correct |
| 27 |
Partially correct |
17 ms |
3572 KB |
Partially correct |
| 28 |
Partially correct |
17 ms |
3416 KB |
Partially correct |
| 29 |
Partially correct |
17 ms |
3416 KB |
Partially correct |
| 30 |
Partially correct |
8 ms |
2904 KB |
Partially correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
