library
This documentation is automatically generated by online-judge-tools/verification-helper
test/mytest/non_adj.test.cpp
- View this file on GitHub
- Last update: 2024-03-29 11:46:13+09:00
- Problem: https://judge.yosupo.jp/problem/aplusb
Depends on
Code
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"
#include "convex/non_adjecent_selection.hpp"
#include "random/base.hpp"
void test() {
FOR(100) {
FOR(N, 10) {
vi A(N);
FOR(i, N) A[i] = RNG(0, 1000000000);
Non_Adjacent_Selection<ll, true> MI(A);
Non_Adjacent_Selection<ll, false> MA(A);
FOR(cnt, ceil<int>(N, 2) + 1) {
ll mi = infty<ll>, ma = -infty<ll>;
FOR(s, 1 << N) {
if (s & (s >> 1)) continue;
if (popcnt(s) != cnt) continue;
ll sm = 0;
FOR(i, N) if (s >> i & 1) sm += A[i];
chmin(mi, sm), chmax(ma, sm);
}
assert(MI.ANS[cnt] == mi);
assert(MA.ANS[cnt] == ma);
{
vc<int> I = MI.restore(cnt);
FOR(k, len(I) - 1) assert(I[k + 1] >= I[k] + 2);
ll sm = 0;
for (auto& i: I) sm += A[i];
assert(mi == sm);
}
{
vc<int> I = MA.restore(cnt);
FOR(k, len(I) - 1) assert(I[k + 1] >= I[k] + 2);
ll sm = 0;
for (auto& i: I) sm += A[i];
assert(ma == sm);
}
}
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
test();
solve();
return 0;
}#line 1 "test/mytest/non_adj.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 1 "my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
// https://codeforces.com/blog/entry/96344
#pragma GCC optimize("Ofast,unroll-loops")
// いまの CF だとこれ入れると動かない？
// #pragma GCC target("avx2,popcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;
template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'000'000'000;
template <>
constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;
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 vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = 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 FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) \
for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#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
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_mod_2(int x) { return __builtin_parity(x); }
int popcnt_mod_2(u32 x) { return __builtin_parity(x); }
int popcnt_mod_2(ll x) { return __builtin_parityll(x); }
int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }
// (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 floor(T a, T b) {
return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return {q, x - q * y};
}
template <typename T, typename U>
T SUM(const vector<U> &A) {
T sm = 0;
for (auto &&a: A) sm += a;
return sm;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) \
sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T>
T POP(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T POP(pq<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(pqg<T> &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>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
if (check_ok) assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
(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) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
// ? は -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>
vector<T> cumsum(vector<U> &A, int off = 1) {
int N = A.size();
vector<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>
vector<int> argsort(const vector<T> &A) {
vector<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;
}
#endif
#line 4 "test/mytest/non_adj.test.cpp"
#line 1 "convex/non_adjecent_selection.hpp"
// https://atcoder.jp/contests/joisc2018/tasks/joisc2018_j
template <typename T, bool MINIMIZE>
struct Non_Adjacent_Selection {
int N;
vc<T> ANS;
vc<pair<int, int>> history;
Non_Adjacent_Selection(vc<T>& A) { calc(A); }
void calc(vc<T> A) {
if (MINIMIZE) {
for (auto& x: A) x = -x;
}
N = len(A);
vc<bool> rest(N + 2, 1);
rest[0] = rest[N + 1] = 0;
vc<pair<int, int>> range(N + 2);
vc<int> left(N + 2), right(N + 2);
vc<T> val(N + 2);
pq<pair<T, int>> que;
FOR(i, N + 2) { left[i] = i - 1, right[i] = i + 1; }
FOR(i, N) {
val[i + 1] = A[i], range[i + 1] = {i, i + 1};
que.emplace(val[i + 1], i + 1);
}
ANS = {0};
while (len(que)) {
auto [add, i] = POP(que);
if (!rest[i]) continue;
ANS.eb(ANS.back() + add);
int L = left[i], R = right[i];
history.eb(range[i]);
if (1 <= L) { right[left[L]] = i, left[i] = left[L]; }
if (R <= N) { left[right[R]] = i, right[i] = right[R]; }
if (rest[L] && rest[R]) {
val[i] = val[L] + val[R] - val[i];
que.emplace(val[i], i);
range[i] = {range[L].fi, range[R].se};
} else {
rest[i] = 0;
}
rest[L] = rest[R] = 0;
}
if (MINIMIZE) {
for (auto& x: ANS) x = -x;
}
}
vc<int> restore(int n) {
vc<int> F(N + 1);
FOR(i, n) {
auto [a, b] = history[i];
F[a]++, F[b]--;
}
F = cumsum<int>(F, 0);
vc<int> I;
FOR(i, N) if (F[i] & 1) I.eb(i);
return I;
}
};
#line 2 "random/base.hpp"
u64 RNG_64() {
static uint64_t x_
= uint64_t(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) { return RNG_64() % lim; }
ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }
#line 7 "test/mytest/non_adj.test.cpp"
void test() {
FOR(100) {
FOR(N, 10) {
vi A(N);
FOR(i, N) A[i] = RNG(0, 1000000000);
Non_Adjacent_Selection<ll, true> MI(A);
Non_Adjacent_Selection<ll, false> MA(A);
FOR(cnt, ceil<int>(N, 2) + 1) {
ll mi = infty<ll>, ma = -infty<ll>;
FOR(s, 1 << N) {
if (s & (s >> 1)) continue;
if (popcnt(s) != cnt) continue;
ll sm = 0;
FOR(i, N) if (s >> i & 1) sm += A[i];
chmin(mi, sm), chmax(ma, sm);
}
assert(MI.ANS[cnt] == mi);
assert(MA.ANS[cnt] == ma);
{
vc<int> I = MI.restore(cnt);
FOR(k, len(I) - 1) assert(I[k + 1] >= I[k] + 2);
ll sm = 0;
for (auto& i: I) sm += A[i];
assert(mi == sm);
}
{
vc<int> I = MA.restore(cnt);
FOR(k, len(I) - 1) assert(I[k + 1] >= I[k] + 2);
ll sm = 0;
for (auto& i: I) sm += A[i];
assert(ma == sm);
}
}
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
test();
solve();
return 0;
}