library
This documentation is automatically generated by online-judge-tools/verification-helper
test/1_mytest/minplus_conv_triple.test.cpp
- View this file on GitHub
- Last update: 2026-10-26 22:59:32+09:00
- Problem: https://judge.yosupo.jp/problem/aplusb
Depends on
- convex/minplus_convolution.hpp
- convex/minplus_convolution_of_triples.hpp
my_template.hpp
- random/base.hpp
Code
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"
#include "random/base.hpp"
#include "convex/minplus_convolution_of_triples.hpp"
void test() {
FOR(N, 0, 300) {
vi A(N), B(N), C(N);
FOR(i, N) A[i] = RNG(1, 1 << 30);
FOR(i, N) B[i] = RNG(1, 1 << 30);
FOR(i, N) C[i] = RNG(1, 1 << 30);
// 愚直
vi dp(2 * N + 1, infty<ll>);
dp[0] = 0;
FOR(i, N) {
ll a = A[i], b = B[i], c = C[i];
vi newdp(2 * N + 1, infty<ll>);
FOR(i, len(dp)) {
if (i + 0 <= 2 * N) chmin(newdp[i + 0], dp[i] + a);
if (i + 1 <= 2 * N) chmin(newdp[i + 1], dp[i] + b);
if (i + 2 <= 2 * N) chmin(newdp[i + 2], dp[i] + c);
}
swap(dp, newdp);
}
Minplus_Convolution_of_Triples<ll> X;
FOR(i, N) X.add(A[i], B[i], C[i]);
X.solve();
FOR(K, 2 * N + 1) {
ll val = X[K];
vc<int> x = X.restore(K);
assert(SUM<int>(x) == K);
ll sm = 0;
FOR(i, N) {
assert(0 <= x[i] && x[i] <= 2);
if (x[i] == 0) sm += A[i];
if (x[i] == 1) sm += B[i];
if (x[i] == 2) sm += C[i];
}
assert(sm == val && val == dp[K]);
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
test();
solve();
return 0;
}#line 1 "test/1_mytest/minplus_conv_triple.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 1 "my_template.hpp"
// Source: https://github.com/maspypy/library/blob/main/my_template.hpp
#if defined(USE_PCH)
#include <my_template_compiled.hpp>
#if defined(__GNUC__)
#pragma GCC optimize("Ofast,unroll-loops")
#if !defined(MASPY_NON_AVX2)
#pragma GCC target("avx2,popcnt")
#endif
#endif
#else // MASPY_TEMPLATE_BODY
#include <bits/stdc++.h>
#include <cassert>
#if defined(__GNUC__)
#pragma GCC optimize("Ofast,unroll-loops")
#endif
using namespace std;
using ll = long long;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;
template <class>
constexpr bool dependent_false = false;
template <class T>
constexpr T infty = [] {
static_assert(dependent_false<T>, "infty<T> is not defined");
return T{};
}();
template <>
constexpr int infty<int> = 1'010'000'000;
template <>
constexpr ll infty<ll> = 2'020'000'000'000'000'000;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * 2'000'000'000'000'000'000;
template <>
constexpr double infty<double> = infty<i128>;
template <>
constexpr long double infty<long double> = infty<i128>;
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using pq_max = priority_queue<T>;
template <class T>
using pq_min = priority_queue<T, vector<T>, greater<T>>;
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR1_R(a) for (ll i = ll(a) - 1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = ll(a) - 1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = ll(b) - 1; i >= ll(a); --i)
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload3(__VA_ARGS__, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
// require y > 0
template <typename T>
T floor(T x, T y) {
return x / y - (x % y < 0);
}
// require y > 0
template <typename T>
T ceil(T x, T y) {
return (x / y) + (x % y > 0);
}
// require y > 0
template <typename T>
T bmod(T x, T y) {
T r = x % y;
return (r < 0 ? r + y : r);
}
// require y > 0
template <typename T>
pair<T, T> divmod(T x, T y) {
T q = x / y, r = x % y;
if (r < 0) --q, r += y;
return {q, r};
}
constexpr auto TEN = [] {
array<u64, 20> A{};
A[0] = 1;
for (int i = 1; i < 20; ++i) A[i] = 10 * A[i - 1];
return A;
}();
template <typename T, typename U>
T SUM(const U &A) {
return std::accumulate(A.begin(), A.end(), T{});
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
template <class C, class T>
inline long long LB(const C &c, const T &x) {
return lower_bound(c.begin(), c.end(), x) - c.begin();
}
template <class C, class T>
inline long long UB(const C &c, const T &x) {
return upper_bound(c.begin(), c.end(), x) - c.begin();
}
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
template <typename T>
T POP(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <class T, class Container, class Compare>
T POP(priority_queue<T, Container, Compare> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(vc<T> &que) {
T a = que.back();
que.pop_back();
return a;
}
template <typename F>
i128 binary_search(F check, i128 ok, i128 ng, bool check_ok = true) {
if (check_ok) assert(check(ok));
while (1) {
i128 x = (ok + ng) / 2;
if (x == ok || x == ng) break;
(check(x) ? ok : ng) = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
(check(x) ? ok : ng) = x;
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
T c = max<T>(a, b);
bool changed = (c != a);
a = c;
return changed;
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
T c = min<T>(a, b);
bool changed = (c != a);
a = c;
return changed;
}
// bit operations
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_sgn(int x) { return (__builtin_parity(unsigned(x)) & 1 ? -1 : 1); }
int popcnt_sgn(u32 x) { return (__builtin_parity(x) & 1 ? -1 : 1); }
int popcnt_sgn(ll x) { return (__builtin_parityll(x) & 1 ? -1 : 1); }
int popcnt_sgn(u64 x) { return (__builtin_parityll(x) & 1 ? -1 : 1); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T kth_bit(int k) {
assert(0 <= k && k < int(8 * sizeof(T)));
return T(1) << k;
}
template <typename T>
bool has_kth_bit(T x, int k) {
assert(0 <= k && k < int(8 * sizeof(T)));
return x >> k & 1;
}
template <typename T>
struct all_bit {
static_assert(is_integral<T>::value);
T s;
all_bit(T s) : s(s) { assert(s >= 0); }
struct iter {
T s;
int operator*() const { return lowbit(s); }
void operator++() { s &= s - 1; }
bool operator!=(nullptr_t) const { return s; }
};
iter begin() const { return {s}; }
nullptr_t end() const { return nullptr; }
};
template <typename T>
struct all_subset {
static_assert(is_integral<T>::value);
T s;
all_subset(T s) : s(s) { assert(s >= 0); }
struct iter {
T s, t;
bool done = false;
T operator*() const { return t; }
void operator++() {
done = (t == 0);
t = (t - 1) & s;
}
bool operator!=(nullptr_t) const { return !done; }
};
iter begin() const { return {s, s}; }
nullptr_t end() const { return nullptr; }
};
constexpr u64 full_mask(int n) {
assert(0 <= n && n <= 64);
return n == 64 ? -1ULL : (1ULL << n) - 1;
}
u64 bit_reverse(u64 x) {
x = ((x & 0x5555555555555555ULL) << 1) | ((x >> 1) & 0x5555555555555555ULL);
x = ((x & 0x3333333333333333ULL) << 2) | ((x >> 2) & 0x3333333333333333ULL);
x = ((x & 0x0f0f0f0f0f0f0f0fULL) << 4) | ((x >> 4) & 0x0f0f0f0f0f0f0f0fULL);
x = ((x & 0x00ff00ff00ff00ffULL) << 8) | ((x >> 8) & 0x00ff00ff00ff00ffULL);
x = ((x & 0x0000ffff0000ffffULL) << 16) | ((x >> 16) & 0x0000ffff0000ffffULL);
x = (x << 32) | (x >> 32);
return x;
}
// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
vc<int> A(S.size());
FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
return A;
}
template <typename T, typename U>
vc<T> cumsum(const vc<U> &A, int off = 1) {
int N = A.size();
vc<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
// stable sort
template <typename T>
vc<int> argsort(const vc<T> &A) {
vc<int> ids(len(A));
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
vc<T> B(len(I));
FOR(i, len(I)) B[i] = A[I[i]];
return B;
}
template <typename T, typename... Vectors>
void concat(vc<T> &first, const Vectors &...others) {
first.reserve(first.size() + (others.size() + ... + 0));
(first.insert(first.end(), others.begin(), others.end()), ...);
}
// i128
template <class T, enable_if_t<is_same_v<T, i128>, int> = 0>
constexpr i128 abs(T x) {
return x < 0 ? -x : x;
}
constexpr i128 gcd(i128 a, i128 b) {
while (b != 0) {
i128 c = a % b;
a = b, b = c;
}
return abs(a);
}
#endif // MASPY_TEMPLATE_BODY
#line 3 "test/1_mytest/minplus_conv_triple.test.cpp"
#line 1 "random/base.hpp"
// Source: https://github.com/maspypy/library/blob/main/random/base.hpp
u64 RNG_64() {
static u64 x_ = u64(chrono::duration_cast<chrono::nanoseconds>(
chrono::high_resolution_clock::now().time_since_epoch())
.count()) *
10150724397891781847ULL;
x_ ^= x_ << 7;
return x_ ^= x_ >> 9;
}
u64 RNG(u64 lim) {
assert(lim > 0);
return RNG_64() % lim;
}
ll RNG(ll l, ll r) {
assert(l < r);
return l + RNG_64() % (r - l);
}
#line 1 "convex/minplus_convolution_of_triples.hpp"
// Source: https://github.com/maspypy/library/blob/main/convex/minplus_convolution_of_triples.hpp
#line 1 "convex/minplus_convolution.hpp"
// Source: https://github.com/maspypy/library/blob/main/convex/minplus_convolution.hpp
template <typename T>
vc<T> minplus_convolution_convex_convex(vc<T>& A, vc<T>& B) {
int n = len(A), m = len(B);
if (n == 0 || m == 0) return {};
vc<T> C(n + m - 1, infty<T>);
while (n > 0 && A[n - 1] == infty<T>) --n;
while (m > 0 && B[m - 1] == infty<T>) --m;
if (n == 0 || m == 0) return C;
int a = 0, b = 0;
while (a < n && A[a] == infty<T>) ++a;
while (b < m && B[b] == infty<T>) ++b;
C[a + b] = A[a] + B[b];
for (int i = a + b + 1; i < n + m - 1; ++i) {
if (b == m - 1 || (a != n - 1 && A[a + 1] + B[b] < A[a] + B[b + 1])) {
chmin(C[i], A[++a] + B[b]);
} else {
chmin(C[i], A[a] + B[++b]);
}
}
return C;
}
template <typename T>
vc<T> minplus_convolution_arbitrary_convex(vc<T>& A, vc<T>& B) {
int n = len(A), m0 = len(B);
if (n == 0 || m0 == 0) return {};
const T INF = infty<T>;
const T BIG = INF + INF + 1;
vc<T> C(n + m0 - 1, INF);
int m = m0;
while (m > 0 && B[m - 1] == INF) --m;
if (m == 0) return C;
int b = 0;
while (b < m && B[b] == INF) ++b;
int z = n + m - b - 1;
vc<int> idx(z + 1);
// 実際に最小値探索する部分だけ BIG にする。
fill(C.begin() + b, C.begin() + n + m - 1, BIG);
idx[0] = 0;
idx[z] = n - 1;
int d = 1;
while (d < z) d <<= 1;
for (int q = d >> 1; q > 0; q >>= 1) {
for (int h = q; h < z; h += q << 1) {
int l = h - q;
int r = min(h + q, z);
idx[h] = idx[l];
for (int j = idx[l]; j <= idx[r]; ++j) {
int k = b + h - j;
if (j <= h && k < m && C[b + h] >= A[j] + B[k]) {
C[b + h] = A[j] + B[k];
idx[h] = j;
}
}
}
}
FOR(h, z) {
int j = idx[h];
int k = b + h - j;
C[b + h] = (A[j] == INF || B[k] == INF ? INF : A[j] + B[k]);
}
return C;
}
template <typename T, bool convA, bool convB>
vc<T> minplus_convolution(vc<T>& A, vc<T>& B) {
static_assert(convA || convB);
if constexpr (convA && convB) return minplus_convolution_convex_convex(A, B);
if constexpr (convA && !convB)
return minplus_convolution_arbitrary_convex(B, A);
if constexpr (convB && !convA)
return minplus_convolution_arbitrary_convex(A, B);
return {};
}
#line 3 "convex/minplus_convolution_of_triples.hpp"
// https://codeforces.com/contest/436/problem/E
// 長さ 3 の数列 {a[i][0], a[i][1], a[i][2]} たちの畳み込み, O(NlogN)
// 同種の問題：(a_i,b_i) があって、b_i は a_i を取ってからだけ取れる
template <typename T>
struct Minplus_Convolution_of_Triples {
int N = 0;
T sm0 = 0;
vc<array<T, 3>> dat;
vc<T> dp1, dp2, dp;
vc<int> I1, I2;
bool solved = false;
void add(T x0, T x1, T x2) { sm0 += x0, dat.eb(array<T, 3>{x0, x1, x2}); }
void solve() {
solved = true;
N = dat.size();
FOR(i, N) {
int a = dat[i][1] - dat[i][0], b = dat[i][2] - dat[i][1];
(a <= b ? I1 : I2).eb(i);
};
sort(all(I2), [&](int i, int j) -> bool {
return dat[i][2] - dat[i][0] < dat[j][2] - dat[j][0];
});
solve_1();
solve_2();
dp = minplus_convolution<T, true, false>(dp1, dp2);
for (auto&& x : dp) x += sm0;
}
T operator[](int i) { return dp[i]; }
vc<int> restore(int k) {
assert(solved);
int k1 = -1, k2 = -1;
FOR(i, k + 1) {
int j = k - i;
if (0 <= i && i < len(dp1) && 0 <= j && j < len(dp2) &&
dp1[i] + dp2[j] + sm0 == dp[k]) {
k1 = i, k2 = j;
break;
}
}
assert(k1 != -1 && k2 != -1);
vc<int> x(N);
vc<int> x1 = restore_1(k1);
vc<int> x2 = restore_2(k2);
for (int i = 0; i < N; ++i) x[i] = x1[i] + x2[i];
return x;
}
private:
void solve_1() {
dp1.reserve(len(I1));
for (int i : I1) {
dp1.eb(dat[i][1] - dat[i][0]), dp1.eb(dat[i][2] - dat[i][1]);
}
sort(all(dp1));
dp1 = cumsum<T>(dp1);
}
vc<int> restore_1(int k) {
vc<pair<T, int>> A;
for (int i : I1) {
A.eb(dat[i][1] - dat[i][0], i);
A.eb(dat[i][2] - dat[i][1], i);
}
nth_element(A.begin(), A.begin() + k, A.end());
vc<int> x(N);
FOR(i, k) x[A[i].se]++;
return x;
}
void solve_2() {
// B-A > C-B のケース
// 解の構造を考えると、ほとんどすべてで x=0 or x=2 というとりかたになる
// 既に C-A でソート済
auto& I = I2;
int n = len(I);
dp2.assign(2 * n + 1, infty<T>);
// 偶数個
dp2[0] = 0;
for (int i = 0; i < n; ++i) {
dp2[2 * i + 2] = dp2[2 * i] + (dat[I[i]][2] - dat[I[i]][0]);
}
// 奇数個, prefix からひとつキャンセルする
T ma = -infty<T>;
for (int i = 0; i < n; ++i) {
chmax(ma, dat[I[i]][2] - dat[I[i]][1]);
chmin(dp2[2 * i + 1], dp2[2 * i + 2] - ma);
}
// 奇数個, suffix からひとつ追加する
T mi = infty<T>;
for (int i = n - 1; i >= 0; --i) {
chmin(mi, dat[I[i]][1] - dat[I[i]][0]);
chmin(dp2[2 * i + 1], dp2[2 * i] + mi);
}
return;
}
vc<int> restore_2(int k) {
auto& I = I2;
int n = len(I);
vc<int> x(N);
if (k % 2 == 0) {
FOR(i, k / 2) x[I[i]] = 2;
return x;
}
pair<T, int> ma = {-infty<T>, -1};
FOR(i, (k + 1) / 2) {
if (chmax(ma.fi, dat[I[i]][2] - dat[I[i]][1])) ma.se = I[i];
}
if (dp2[k] == dp2[k + 1] - ma.fi) {
FOR(i, (k + 1) / 2) x[I[i]] = 2;
x[ma.se]--;
return x;
}
pair<T, int> mi = {infty<T>, -1};
for (int i = n - 1; i >= k / 2; --i) {
if (chmin(mi.fi, dat[I[i]][1] - dat[I[i]][0])) mi.se = I[i];
}
if (dp2[k] == dp2[k - 1] + mi.fi) {
FOR(i, (k - 1) / 2) x[I[i]] = 2;
x[mi.se] = 1;
return x;
}
assert(0);
return x;
}
};
#line 6 "test/1_mytest/minplus_conv_triple.test.cpp"
void test() {
FOR(N, 0, 300) {
vi A(N), B(N), C(N);
FOR(i, N) A[i] = RNG(1, 1 << 30);
FOR(i, N) B[i] = RNG(1, 1 << 30);
FOR(i, N) C[i] = RNG(1, 1 << 30);
// 愚直
vi dp(2 * N + 1, infty<ll>);
dp[0] = 0;
FOR(i, N) {
ll a = A[i], b = B[i], c = C[i];
vi newdp(2 * N + 1, infty<ll>);
FOR(i, len(dp)) {
if (i + 0 <= 2 * N) chmin(newdp[i + 0], dp[i] + a);
if (i + 1 <= 2 * N) chmin(newdp[i + 1], dp[i] + b);
if (i + 2 <= 2 * N) chmin(newdp[i + 2], dp[i] + c);
}
swap(dp, newdp);
}
Minplus_Convolution_of_Triples<ll> X;
FOR(i, N) X.add(A[i], B[i], C[i]);
X.solve();
FOR(K, 2 * N + 1) {
ll val = X[K];
vc<int> x = X.restore(K);
assert(SUM<int>(x) == K);
ll sm = 0;
FOR(i, N) {
assert(0 <= x[i] && x[i] <= 2);
if (x[i] == 0) sm += A[i];
if (x[i] == 1) sm += B[i];
if (x[i] == 2) sm += C[i];
}
assert(sm == val && val == dp[K]);
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
test();
solve();
return 0;
}