This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/704
#include "../../template/template.hpp"
#include "../../dp/online-offline-dp.hpp"
int main() {
int n;
cin >> n;
vector< int > a(n), x(n), y(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> x[i];
for(int i = 0; i < n; i++) cin >> y[i];
function< int64_t(int, int) > dist = [&](int i, int j) {
assert(0 <= i && i < j && j <= n);
int s = abs(a[j - 1] - x[i]);
int t = abs(y[i]);
return s + t;
};
cout << online_offline_dp(n, dist).back() << endl;
}
#line 1 "test/verify/yukicoder-704.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/704
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/yukicoder-704.test.cpp"
#line 1 "dp/monotone-minima.hpp"
template <typename T, typename Compare = less<T> >
vector<pair<int, T> > monotone_minima(int H, int W,
const function<T(int, int)> &f,
const Compare &comp = Compare()) {
vector<pair<int, T> > dp(H);
function<void(int, int, int, int)> dfs = [&](int top, int bottom, int left,
int right) {
if (top > bottom) return;
int line = (top + bottom) / 2;
T ma;
int mi = -1;
for (int i = left; i <= right; i++) {
T cst = f(line, i);
if (mi == -1 || comp(cst, ma)) {
ma = cst;
mi = i;
}
}
dp[line] = make_pair(mi, ma);
dfs(top, line - 1, left, mi);
dfs(line + 1, bottom, mi, right);
};
dfs(0, H - 1, 0, W - 1);
return dp;
}
#line 2 "dp/online-offline-dp.hpp"
template <typename T, typename Compare = less<T> >
vector<T> online_offline_dp(int W, const function<T(int, int)> &f,
const Compare &comp = Compare()) {
vector<T> dp(W + 1);
vector<int> isset(W + 1);
int y_base = -1, x_base = -1;
function<T(int, int)> get_cost =
[&](int y, int x) { // return dp[0, x+x_base)+f[x+x_base, y+y_base)
return dp[x + x_base] + f(x + x_base, y + y_base);
};
function<void(int, int, int)> induce = [&](int l, int m,
int r) { // dp[l, m) -> dp[m, r)
x_base = l, y_base = m;
auto ret = monotone_minima(r - m, m - l, get_cost, comp);
for (int i = 0; i < ret.size(); i++) {
if (!isset[m + i] || comp(ret[i].second, dp[m + i])) {
isset[m + i] = true;
dp[m + i] = ret[i].second;
}
}
};
function<void(int, int)> dfs = [&](int l, int r) {
if (l + 1 == r) {
x_base = l, y_base = l;
T cst = l ? get_cost(0, -1) : 0;
if (!isset[l] || comp(cst, dp[l])) {
isset[l] = true;
dp[l] = cst;
}
} else {
int mid = (l + r) / 2;
dfs(l, mid);
induce(l, mid, r);
dfs(mid, r);
}
};
dfs(0, W + 1);
return dp;
};
#line 6 "test/verify/yukicoder-704.test.cpp"
int main() {
int n;
cin >> n;
vector< int > a(n), x(n), y(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> x[i];
for(int i = 0; i < n; i++) cin >> y[i];
function< int64_t(int, int) > dist = [&](int i, int j) {
assert(0 <= i && i < j && j <= n);
int s = abs(a[j - 1] - x[i]);
int t = abs(y[i]);
return s + t;
};
cout << online_offline_dp(n, dist).back() << endl;
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample1.txt | AC | 6 ms | 4 MB |
g++ | 00_sample2.txt | AC | 6 ms | 4 MB |
g++ | 00_sample3.txt | AC | 6 ms | 4 MB |
g++ | 00_sample4.txt | AC | 6 ms | 4 MB |
g++ | 20_small1.txt | AC | 6 ms | 4 MB |
g++ | 20_small10.txt | AC | 6 ms | 4 MB |
g++ | 20_small2.txt | AC | 6 ms | 4 MB |
g++ | 20_small3.txt | AC | 6 ms | 4 MB |
g++ | 20_small4.txt | AC | 6 ms | 4 MB |
g++ | 20_small5.txt | AC | 6 ms | 4 MB |
g++ | 20_small6.txt | AC | 6 ms | 4 MB |
g++ | 20_small7.txt | AC | 6 ms | 4 MB |
g++ | 20_small8.txt | AC | 6 ms | 4 MB |
g++ | 20_small9.txt | AC | 6 ms | 4 MB |
g++ | 30_medium1.txt | AC | 6 ms | 4 MB |
g++ | 30_medium10.txt | AC | 6 ms | 4 MB |
g++ | 30_medium2.txt | AC | 6 ms | 4 MB |
g++ | 30_medium3.txt | AC | 6 ms | 4 MB |
g++ | 30_medium4.txt | AC | 7 ms | 4 MB |
g++ | 30_medium5.txt | AC | 6 ms | 4 MB |
g++ | 30_medium6.txt | AC | 6 ms | 4 MB |
g++ | 30_medium7.txt | AC | 6 ms | 4 MB |
g++ | 30_medium8.txt | AC | 6 ms | 4 MB |
g++ | 30_medium9.txt | AC | 6 ms | 4 MB |
g++ | 40_large1.txt | AC | 286 ms | 13 MB |
g++ | 40_large10.txt | AC | 287 ms | 13 MB |
g++ | 40_large2.txt | AC | 285 ms | 13 MB |
g++ | 40_large3.txt | AC | 286 ms | 13 MB |
g++ | 40_large4.txt | AC | 286 ms | 13 MB |
g++ | 40_large5.txt | AC | 284 ms | 13 MB |
g++ | 40_large6.txt | AC | 287 ms | 13 MB |
g++ | 40_large7.txt | AC | 285 ms | 13 MB |
g++ | 40_large8.txt | AC | 286 ms | 13 MB |
g++ | 40_large9.txt | AC | 285 ms | 13 MB |
g++ | 50_large_binary1.txt | AC | 284 ms | 13 MB |
g++ | 50_large_binary10.txt | AC | 285 ms | 13 MB |
g++ | 50_large_binary2.txt | AC | 284 ms | 13 MB |
g++ | 50_large_binary3.txt | AC | 287 ms | 13 MB |
g++ | 50_large_binary4.txt | AC | 285 ms | 13 MB |
g++ | 50_large_binary5.txt | AC | 287 ms | 13 MB |
g++ | 50_large_binary6.txt | AC | 284 ms | 13 MB |
g++ | 50_large_binary7.txt | AC | 284 ms | 13 MB |
g++ | 50_large_binary8.txt | AC | 285 ms | 13 MB |
g++ | 50_large_binary9.txt | AC | 285 ms | 13 MB |
g++ | 99_corner1.txt | AC | 6 ms | 4 MB |
g++ | 99_corner2.txt | AC | 6 ms | 4 MB |
g++ | 99_corner3.txt | AC | 293 ms | 13 MB |
g++ | 99_corner4.txt | AC | 292 ms | 13 MB |
clang++ | 00_sample1.txt | AC | 6 ms | 4 MB |
clang++ | 00_sample2.txt | AC | 6 ms | 4 MB |
clang++ | 00_sample3.txt | AC | 6 ms | 4 MB |
clang++ | 00_sample4.txt | AC | 6 ms | 4 MB |
clang++ | 20_small1.txt | AC | 6 ms | 4 MB |
clang++ | 20_small10.txt | AC | 6 ms | 4 MB |
clang++ | 20_small2.txt | AC | 6 ms | 4 MB |
clang++ | 20_small3.txt | AC | 6 ms | 4 MB |
clang++ | 20_small4.txt | AC | 6 ms | 4 MB |
clang++ | 20_small5.txt | AC | 6 ms | 4 MB |
clang++ | 20_small6.txt | AC | 6 ms | 4 MB |
clang++ | 20_small7.txt | AC | 6 ms | 4 MB |
clang++ | 20_small8.txt | AC | 6 ms | 4 MB |
clang++ | 20_small9.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium1.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium10.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium2.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium3.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium4.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium5.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium6.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium7.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium8.txt | AC | 6 ms | 4 MB |
clang++ | 30_medium9.txt | AC | 7 ms | 4 MB |
clang++ | 40_large1.txt | AC | 278 ms | 13 MB |
clang++ | 40_large10.txt | AC | 278 ms | 13 MB |
clang++ | 40_large2.txt | AC | 278 ms | 13 MB |
clang++ | 40_large3.txt | AC | 278 ms | 13 MB |
clang++ | 40_large4.txt | AC | 278 ms | 13 MB |
clang++ | 40_large5.txt | AC | 275 ms | 13 MB |
clang++ | 40_large6.txt | AC | 279 ms | 13 MB |
clang++ | 40_large7.txt | AC | 277 ms | 13 MB |
clang++ | 40_large8.txt | AC | 276 ms | 13 MB |
clang++ | 40_large9.txt | AC | 279 ms | 13 MB |
clang++ | 50_large_binary1.txt | AC | 277 ms | 13 MB |
clang++ | 50_large_binary10.txt | AC | 276 ms | 13 MB |
clang++ | 50_large_binary2.txt | AC | 275 ms | 13 MB |
clang++ | 50_large_binary3.txt | AC | 278 ms | 13 MB |
clang++ | 50_large_binary4.txt | AC | 276 ms | 13 MB |
clang++ | 50_large_binary5.txt | AC | 278 ms | 13 MB |
clang++ | 50_large_binary6.txt | AC | 279 ms | 13 MB |
clang++ | 50_large_binary7.txt | AC | 277 ms | 13 MB |
clang++ | 50_large_binary8.txt | AC | 278 ms | 13 MB |
clang++ | 50_large_binary9.txt | AC | 276 ms | 13 MB |
clang++ | 99_corner1.txt | AC | 6 ms | 4 MB |
clang++ | 99_corner2.txt | AC | 6 ms | 4 MB |
clang++ | 99_corner3.txt | AC | 286 ms | 13 MB |
clang++ | 99_corner4.txt | AC | 285 ms | 13 MB |