#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint INF = 2e15;
int N, C;
vector<lint> X;
vector<lint> D;
vector<int> SUM; // index of increasing X[i] + D[i]
vector<int> DIF; // index of increasing X[i] - D[i]
bool is_valid(lint T) {
bool valid = false;
lint max_sum = +INF; // maximum of S1 + S2 that is valid
lint min_sum = -INF; // minimum of S1 + S2 that is valid
lint max_dif = +INF; // maximum of S1 - S2 that is valid
lint min_dif = -INF; // minimum of S1 - S2 that is valid
lint sum_big = -INF; // maximum X[i] + D[i], for all valid i
lint sum_sml = -INF; // second maximum X[i] + D[i], for all valid i
lint sum_idx = -1; // index of sum_big
lint dif_sml = +INF; // minimum X[i] - D[i], for all valid i
lint dif_big = +INF; // second minimum X[i] - D[i], for all valid i
lint dif_idx = -1; // index of dif_sml
lint new_sum = X[DIF[0]] + D[DIF[0]];
lint new_dif = X[DIF[0]] - D[DIF[0]];
lint cur_sum;
lint cur_dif;
lint valid_sum;
lint valid_dif;
for (int j = 0, pos = 0; j < N; j++) {
cur_sum = X[SUM[j]] + D[SUM[j]];
cur_dif = X[SUM[j]] - D[SUM[j]];
while (pos < N && cur_sum - new_dif > T) {
if (sum_big < new_sum) {
sum_sml = sum_big;
sum_big = new_sum;
sum_idx = DIF[pos];
} else if (sum_sml < new_sum) {
sum_sml = new_sum;
}
if (dif_sml > new_dif) {
dif_big = dif_sml;
dif_sml = new_dif;
dif_idx = DIF[pos];
} else if (dif_big > new_dif) {
dif_big = new_dif;
}
pos++;
new_sum = X[DIF[pos]] + D[DIF[pos]];
new_dif = X[DIF[pos]] - D[DIF[pos]];
}
valid_sum = ((SUM[j] == sum_idx)? sum_sml : sum_big);
valid_dif = ((SUM[j] == dif_idx)? dif_big : dif_sml);
max_sum = min(max_sum, + T + valid_dif + cur_dif - C);
min_sum = max(min_sum, - T + valid_sum + cur_sum + C);
max_dif = min(max_dif, + T + valid_dif - cur_sum - C);
min_dif = max(min_dif, - T + valid_sum - cur_dif + C);
}
for (int i = 0, ptl = 0, ptr = N - 1, pos; i < N && !valid; i++) {
while (ptl < N && X[ptl] - X[i] < min_dif) ptl++;
while (ptr >= 0 && X[ptr] + X[i] >= min_sum) ptr--;
pos = max(ptl, ptr + 1);
valid |= (pos < N && min_sum <= X[pos] + X[i] && X[pos] + X[i] <= max_sum
&& min_dif <= X[pos] - X[i] && X[pos] - X[i] <= max_dif);
}
return valid;
}
lint find_shortcut(int n_, vector<int> l_, vector<int> d_, int c_) {
N = n_, C = c_;
X.reserve(N), D.reserve(N), SUM.reserve(N), DIF.reserve(N);
X.resize(N), D.resize(N), SUM.resize(N), DIF.resize(N);
for (int i = 0; i < l_.size(); i++)
X[i + 1] = X[i] + l_[i];
for (int i = 0; i < d_.size(); i++)
D[i] = d_[i];
iota(SUM.begin(), SUM.end(), 0), iota(DIF.begin(), DIF.end(), 0);
sort(SUM.begin(), SUM.end(), [&] (int l, int r) { return X[l] + D[l] < X[r] + D[r]; });
sort(DIF.begin(), DIF.end(), [&] (int l, int r) { return X[l] - D[l] < X[r] - D[r]; });
lint res = 0;
for (lint L = 0, R = INF, M = (L + R) / 2; L <= R; M = (L + R) / 2)
if (is_valid(M))
R = M - 1, res = M;
else
L = M + 1;
return res;
}
Compilation message
shortcut.cpp: In function 'lint find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:84:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < l_.size(); i++)
~~^~~~~~~~~~~
shortcut.cpp:86:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < d_.size(); i++)
~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
2 ms |
256 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
2 ms |
256 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
2 ms |
376 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
2 ms |
376 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
2 ms |
256 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
2 ms |
376 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
2 ms |
376 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
2 ms |
380 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
2 ms |
256 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
2 ms |
376 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
2 ms |
256 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
2 ms |
376 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
2 ms |
256 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
2 ms |
256 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
2 ms |
252 KB |
n = 5, 4000000000 is a correct answer |
17 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Halted |
0 ms |
0 KB |
- |