#include <bits/stdc++.h>
#define pb push_back
#define int int64_t
#include "shortcut.h"
//#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif
using namespace std;
constexpr static int SPECIAL_CHECK = 80;
constexpr static int MXN = 1e6 + 5;
constexpr static int INF = 1e18;
int pf[MXN];
array<int, 2> jv[MXN];
array<int, 2> iv[MXN];
vector<int> d, l;
int c, n;
static inline int dist(int a, int b)
{
return pf[max(a, b)] - pf[min(a, b)];
}
vector<int> order;
bool check(int k)
{
int xl = -INF, xr = INF, yl = -INF, yr = INF;
int w = -1;
int mna = INF, mxa = -INF, mnb = INF, mxb = -INF;
for (int l = 0; l < n; l++)
{
int j = jv[l][1];
while (w < n-1 && jv[l][0] - iv[w+1][0] > k)
{
w++;
int i = iv[w][1];
debug(j, i);
mna = min(mna, pf[i] - d[i]);
mxa = max(mxa, pf[i] - d[i]);
mnb = min(mnb, pf[i] + d[i]);
mxb = max(mxb, pf[i] + d[i]);
}
if (w == -1)
continue;
xl = max(xl, mxb - k + pf[j] + d[j] + c);
xr = min(xr, mna + k + pf[j] - d[j] - c);
yl = max(yl, -mna - k + pf[j] + d[j] + c);
yr = min(yr, -mxb + k + pf[j] - d[j] - c);
}
/*
for (int i = 0; i < n; i++)
{
for (int j = i+1; j < n; j++)
{
if (dist(i, j) + d[i] + d[j] > k)
{
xl = max(xl, pf[j] + pf[i] - k + c + d[i] + d[j]);
xr = min(xr, pf[j] + pf[i] + k - c - d[i] - d[j]);
yl = max(yl, pf[j] - pf[i] - k + c + d[i] + d[j]);
yr = min(yr, pf[j] - pf[i] + k - c - d[i] - d[j]);
}
}
}
*/
xr++, yr++;
if (k == SPECIAL_CHECK)
debug(xl, xr, yl, yr);
if (xr <= xl || yr <= yl)
return false;
int xs = n, xe = n, ys = 1, ye = 1;
for (int i = 0; i < n; i++)
{
while (xs > 0 && pf[xs-1] + pf[i] >= xl) xs--;
while (xe > 0 && pf[xe-1] + pf[i] >= xr) xe--;
while (ys < n && pf[ys] - pf[i] < yl) ys++;
while (ye < n && pf[ye] - pf[i] < yr) ye++;
if (max(xs, ys) < min(xe, ye))
return true;
}
return false;
}
long long find_shortcut(int32_t _n, vector<int32_t> _l, vector<int32_t> _d, int32_t _c)
{
c = _c;
n = _n;
for (int i : _l)
l.pb(i);
for (int i : _d)
d.pb(i);
for (int i = 1; i <= n; i++)
pf[i] = pf[i-1] + l[i-1];
for (int j = 0; j < n; j++)
jv[j] = {pf[j] + d[j], j};
sort(jv, jv + n);
for (int i = 0; i < n; i++)
iv[i] = {pf[i] - d[i], i};
sort(iv, iv + n);
for (int i = 0; i < n; i++)
debug(iv[i]);
for (int j = 0; j < n; j++)
debug(jv[j]);
int ll = 0, rr = INF;
while (rr - ll > 1)
{
int m = ll+rr>>1;
if (check(m))
rr = m;
else
ll = m;
}
check(SPECIAL_CHECK);
return rr;
}
Compilation message
shortcut.cpp: In function 'long long int find_shortcut(int32_t, std::vector<int>, std::vector<int>, int32_t)':
shortcut.cpp:113:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
113 | int m = ll+rr>>1;
| ~~^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
212 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
212 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
212 KB |
n = 3, 4 is a correct answer |
5 |
Incorrect |
0 ms |
212 KB |
n = 2, incorrect answer: jury 62 vs contestant 72 |
6 |
Halted |
0 ms |
0 KB |
- |