This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2603
#include "../../template/template.hpp"
#include "../../dp/divide-and-conquer-optimization.hpp"
int main() {
int S, N, M;
cin >> S >> N >> M;
vector< int > X(S);
cin >> X;
vector< int > T(N);
for(int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
T[i] = a - X[--b];
}
sort(begin(T), end(T));
auto mat = make_v< int >(N, N);
for(int right = N - 1; right >= 0; right--) {
for(int left = right - 1; left >= 0; left--) {
mat[left][right] = mat[left + 1][right] + T[right] - T[left];
}
}
auto val = divide_and_conquer_optimization< int >(M, N, inf, [&](int a, int b) { return mat[a][b - 1]; });
int ret = inf;
for(int k = 0; k < val.size(); k++) chmin(ret, val[k].back());
cout << ret << "\n";
}
#line 1 "test/verify/aoj-2603.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2603
#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/aoj-2603.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/divide-and-conquer-optimization.hpp"
template< typename T, typename Compare = less< T > >
vector< vector< T > > divide_and_conquer_optimization(int H, int W, T INF, const function< T(int, int) > &f, const Compare &comp = Compare()) {
vector< vector< T > > dp(H + 1, vector< T >(W + 1, INF));
dp[0][0] = 0;
for(int i = 1; i <= H; i++) {
function< T(int, int) > get_cost = [&](int y, int x) {
if(x >= y) return INF;
return dp[i - 1][x] + f(x, y);
};
auto ret = monotone_minima(W + 1, W + 1, get_cost, comp);
for(int j = 0; j <= W; j++) dp[i][j] = ret[j].second;
}
return dp;
}
#line 6 "test/verify/aoj-2603.test.cpp"
int main() {
int S, N, M;
cin >> S >> N >> M;
vector< int > X(S);
cin >> X;
vector< int > T(N);
for(int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
T[i] = a - X[--b];
}
sort(begin(T), end(T));
auto mat = make_v< int >(N, N);
for(int right = N - 1; right >= 0; right--) {
for(int left = right - 1; left >= 0; left--) {
mat[left][right] = mat[left + 1][right] + T[right] - T[left];
}
}
auto val = divide_and_conquer_optimization< int >(M, N, inf, [&](int a, int b) { return mat[a][b - 1]; });
int ret = inf;
for(int k = 0; k < val.size(); k++) chmin(ret, val[k].back());
cout << ret << "\n";
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample_00.txt | AC | 6 ms | 4 MB |
g++ | 00_sample_01.txt | AC | 6 ms | 4 MB |
g++ | 00_sample_02.txt | AC | 6 ms | 4 MB |
g++ | 01_teuchi_00.txt | AC | 6 ms | 4 MB |
g++ | 99_large_random_0.txt | AC | 28 ms | 6 MB |
g++ | 99_large_random_1.txt | AC | 24 ms | 6 MB |
g++ | 99_large_random_2.txt | AC | 13 ms | 5 MB |
g++ | 99_large_random_3.txt | AC | 25 ms | 6 MB |
g++ | 99_large_random_4.txt | AC | 46 ms | 7 MB |
g++ | 99_large_random_5.txt | AC | 26 ms | 6 MB |
g++ | 99_large_random_6.txt | AC | 18 ms | 5 MB |
g++ | 99_large_random_7.txt | AC | 25 ms | 6 MB |
g++ | 99_large_random_8.txt | AC | 43 ms | 7 MB |
g++ | 99_large_random_9.txt | AC | 51 ms | 7 MB |
g++ | 99_max_random_0.txt | AC | 73 ms | 22 MB |
g++ | 99_max_random_1.txt | AC | 56 ms | 21 MB |
g++ | 99_max_random_2.txt | AC | 94 ms | 23 MB |
g++ | 99_max_random_3.txt | AC | 115 ms | 24 MB |
g++ | 99_max_random_4.txt | AC | 100 ms | 23 MB |
g++ | 99_max_random_5.txt | AC | 104 ms | 23 MB |
g++ | 99_max_random_6.txt | AC | 136 ms | 25 MB |
g++ | 99_max_random_7.txt | AC | 163 ms | 27 MB |
g++ | 99_max_random_8.txt | AC | 25 ms | 20 MB |
g++ | 99_max_random_9.txt | AC | 30 ms | 20 MB |
g++ | 99_middle_random_0.txt | AC | 13 ms | 4 MB |
g++ | 99_middle_random_1.txt | AC | 24 ms | 5 MB |
g++ | 99_middle_random_2.txt | AC | 30 ms | 6 MB |
g++ | 99_middle_random_3.txt | AC | 11 ms | 4 MB |
g++ | 99_middle_random_4.txt | AC | 7 ms | 4 MB |
g++ | 99_middle_random_5.txt | AC | 8 ms | 4 MB |
g++ | 99_middle_random_6.txt | AC | 9 ms | 4 MB |
g++ | 99_middle_random_7.txt | AC | 21 ms | 5 MB |
g++ | 99_middle_random_8.txt | AC | 32 ms | 6 MB |
g++ | 99_middle_random_9.txt | AC | 31 ms | 6 MB |
g++ | 99_small_random_0.txt | AC | 13 ms | 4 MB |
g++ | 99_small_random_1.txt | AC | 8 ms | 4 MB |
g++ | 99_small_random_2.txt | AC | 7 ms | 4 MB |
g++ | 99_small_random_3.txt | AC | 13 ms | 4 MB |
g++ | 99_small_random_4.txt | AC | 15 ms | 4 MB |
g++ | 99_small_random_5.txt | AC | 12 ms | 4 MB |
g++ | 99_small_random_6.txt | AC | 14 ms | 4 MB |
g++ | 99_small_random_7.txt | AC | 12 ms | 4 MB |
g++ | 99_small_random_8.txt | AC | 10 ms | 4 MB |
g++ | 99_small_random_9.txt | AC | 11 ms | 4 MB |
g++ | 99_tiny_random_0.txt | AC | 6 ms | 4 MB |
g++ | 99_tiny_random_1.txt | AC | 7 ms | 4 MB |
g++ | 99_tiny_random_2.txt | AC | 7 ms | 4 MB |
g++ | 99_tiny_random_3.txt | AC | 7 ms | 4 MB |
g++ | 99_tiny_random_4.txt | AC | 7 ms | 4 MB |
g++ | 99_tiny_random_5.txt | AC | 6 ms | 4 MB |
g++ | 99_tiny_random_6.txt | AC | 6 ms | 4 MB |
g++ | 99_tiny_random_7.txt | AC | 6 ms | 4 MB |
g++ | 99_tiny_random_8.txt | AC | 6 ms | 4 MB |
g++ | 99_tiny_random_9.txt | AC | 6 ms | 4 MB |
clang++ | 00_sample_00.txt | AC | 6 ms | 4 MB |
clang++ | 00_sample_01.txt | AC | 6 ms | 4 MB |
clang++ | 00_sample_02.txt | AC | 6 ms | 4 MB |
clang++ | 01_teuchi_00.txt | AC | 6 ms | 4 MB |
clang++ | 99_large_random_0.txt | AC | 27 ms | 6 MB |
clang++ | 99_large_random_1.txt | AC | 22 ms | 6 MB |
clang++ | 99_large_random_2.txt | AC | 13 ms | 5 MB |
clang++ | 99_large_random_3.txt | AC | 23 ms | 6 MB |
clang++ | 99_large_random_4.txt | AC | 42 ms | 7 MB |
clang++ | 99_large_random_5.txt | AC | 24 ms | 6 MB |
clang++ | 99_large_random_6.txt | AC | 18 ms | 5 MB |
clang++ | 99_large_random_7.txt | AC | 23 ms | 6 MB |
clang++ | 99_large_random_8.txt | AC | 39 ms | 7 MB |
clang++ | 99_large_random_9.txt | AC | 47 ms | 7 MB |
clang++ | 99_max_random_0.txt | AC | 70 ms | 22 MB |
clang++ | 99_max_random_1.txt | AC | 54 ms | 21 MB |
clang++ | 99_max_random_2.txt | AC | 87 ms | 23 MB |
clang++ | 99_max_random_3.txt | AC | 106 ms | 24 MB |
clang++ | 99_max_random_4.txt | AC | 91 ms | 23 MB |
clang++ | 99_max_random_5.txt | AC | 94 ms | 23 MB |
clang++ | 99_max_random_6.txt | AC | 122 ms | 25 MB |
clang++ | 99_max_random_7.txt | AC | 149 ms | 27 MB |
clang++ | 99_max_random_8.txt | AC | 25 ms | 20 MB |
clang++ | 99_max_random_9.txt | AC | 29 ms | 20 MB |
clang++ | 99_middle_random_0.txt | AC | 13 ms | 4 MB |
clang++ | 99_middle_random_1.txt | AC | 23 ms | 5 MB |
clang++ | 99_middle_random_2.txt | AC | 28 ms | 6 MB |
clang++ | 99_middle_random_3.txt | AC | 10 ms | 4 MB |
clang++ | 99_middle_random_4.txt | AC | 7 ms | 4 MB |
clang++ | 99_middle_random_5.txt | AC | 8 ms | 4 MB |
clang++ | 99_middle_random_6.txt | AC | 9 ms | 4 MB |
clang++ | 99_middle_random_7.txt | AC | 20 ms | 5 MB |
clang++ | 99_middle_random_8.txt | AC | 30 ms | 6 MB |
clang++ | 99_middle_random_9.txt | AC | 28 ms | 6 MB |
clang++ | 99_small_random_0.txt | AC | 13 ms | 4 MB |
clang++ | 99_small_random_1.txt | AC | 8 ms | 4 MB |
clang++ | 99_small_random_2.txt | AC | 7 ms | 4 MB |
clang++ | 99_small_random_3.txt | AC | 12 ms | 4 MB |
clang++ | 99_small_random_4.txt | AC | 14 ms | 4 MB |
clang++ | 99_small_random_5.txt | AC | 12 ms | 4 MB |
clang++ | 99_small_random_6.txt | AC | 13 ms | 4 MB |
clang++ | 99_small_random_7.txt | AC | 11 ms | 4 MB |
clang++ | 99_small_random_8.txt | AC | 10 ms | 4 MB |
clang++ | 99_small_random_9.txt | AC | 11 ms | 4 MB |
clang++ | 99_tiny_random_0.txt | AC | 6 ms | 4 MB |
clang++ | 99_tiny_random_1.txt | AC | 7 ms | 4 MB |
clang++ | 99_tiny_random_2.txt | AC | 7 ms | 4 MB |
clang++ | 99_tiny_random_3.txt | AC | 6 ms | 4 MB |
clang++ | 99_tiny_random_4.txt | AC | 7 ms | 4 MB |
clang++ | 99_tiny_random_5.txt | AC | 6 ms | 4 MB |
clang++ | 99_tiny_random_6.txt | AC | 6 ms | 4 MB |
clang++ | 99_tiny_random_7.txt | AC | 6 ms | 4 MB |
clang++ | 99_tiny_random_8.txt | AC | 6 ms | 4 MB |
clang++ | 99_tiny_random_9.txt | AC | 6 ms | 4 MB |