#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "template/template.hpp"
#include "data-structure/range-add-range-positive-sum.hpp"
#include "util/xorshift.hpp"
long long naive_sum(const vector<long long>& a, int l, int r) {
long long ret = 0;
rep(i, l, r) ret += max(0LL, a[i]);
return ret;
}
void check_all(const RangeAddRangePositiveSum<long long>& ds, const vector<long long>& a) {
int n = a.size();
rep(l, 0, n + 1) rep(r, l, n + 1) {
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
void add_naive(vector<long long>& a, int l, int r, long long v) {
rep(i, l, r) a[i] += v;
}
pair<int, int> random_interval(int n) {
int l = n == 0 ? 0 : XORShift::xor32() % (n + 1);
int r = n == 0 ? 0 : XORShift::xor32() % (n + 1);
if (l > r) swap(l, r);
return {l, r};
}
void test_fixed() {
rep(n, 0, 80) {
vector<long long> a(n);
rep(i, 0, n) a[i] = i % 7 - 3;
RangeAddRangePositiveSum<long long> ds(a);
check_all(ds, a);
vector<tuple<int, int, long long>> qs;
qs.push_back({0, n, 5});
qs.push_back({0, min(n, 1), -10});
qs.push_back({n / 2, n, 4});
qs.push_back({0, n / 2, -3});
qs.push_back({n, n, 100});
if (n >= 2) qs.push_back({1, n - 1, 2});
for (auto [l, r, v] : qs) {
ds.add(l, r, v);
add_naive(a, l, r, v);
check_all(ds, a);
}
}
}
void test_random() {
rep(n, 0, 120) {
vector<long long> a(n);
rep(i, 0, n) a[i] = (long long)(XORShift::xor32() % 21) - 10;
RangeAddRangePositiveSum<long long> ds(a);
check_all(ds, a);
rep(_, 0, 500) {
auto [l, r] = random_interval(n);
if (XORShift::xor32() % 2) {
long long v = (long long)(XORShift::xor32() % 41) - 20;
ds.add(l, r, v);
add_naive(a, l, r, v);
} else {
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
check_all(ds, a);
}
}
void test_random_large() {
for (int n : {128, 257, 511, 1000, 2000}) {
vector<long long> a(n);
rep(i, 0, n) a[i] = (long long)(XORShift::xor32() % 2001) - 1000;
RangeAddRangePositiveSum<long long> ds(a);
rep(_, 0, 3000) {
auto [l, r] = random_interval(n);
if (XORShift::xor32() % 2) {
long long v = (long long)(XORShift::xor32() % 2001) - 1000;
ds.add(l, r, v);
add_naive(a, l, r, v);
} else {
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
rep(_, 0, 200) {
auto [l, r] = random_interval(n);
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
}
int main() {
test_fixed();
test_random();
test_random_large();
int a, b;
in(a, b);
out(a + b);
}
#line 1 "verify/data-structure/UNIT_range_add_range_positive_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 2 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#line 2 "template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "template/template.hpp"
#line 2 "template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <class T>
using priority_queue_asc = priority_queue<T, vector<T>, greater<T>>;
template <class T, class S = T>
S SUM(const vector<T>& a) {
return accumulate(ALL(a), S(0));
}
template <class T1, class T2>
inline bool chmin(T1& a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmax(T1& a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmin_opt(optional<T1>& a, T2 b) {
if (!a || a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmax_opt(optional<T1>& a, T2 b) {
if (!a || a < b) {
a = b;
return true;
}
return false;
}
template <class T>
int popcnt(T x) {
return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "template/template.hpp"
#line 2 "template/inout.hpp"
struct Fast {
Fast() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} fast;
ostream& operator<<(ostream& os, __uint128_t x) {
char buf[40];
size_t k = 0;
while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
if (k == 0) buf[k++] = '0';
while (k) os << buf[--k];
return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
for (auto& v : a) is >> v;
return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
for (auto it = a.begin(); it != a.end();) {
os << *it;
if (++it != a.end()) os << " ";
}
return os;
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
for (auto it = a.begin(); it != a.end();) {
os << *it;
if (++it != a.end()) os << " ";
}
return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
os << "{";
for (auto it = st.begin(); it != st.end();) {
os << *it;
if (++it != st.end()) os << ",";
}
os << "}";
return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
os << "{";
for (auto it = mp.begin(); it != mp.end();) {
os << it->first << ":" << it->second;
if (++it != mp.end()) os << ",";
}
os << "}";
return os;
}
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
template <class... T>
void in_zip(int n, T&... t) {
assert(n >= 0 && ((size(t) >= static_cast<size_t>(n)) && ...));
for (int i = 0; i < n; i++) in(t[i]...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
template <class T, class U>
void out_opt(const optional<T>& opt, const U& fallback, ostream& os = cout) {
if (opt.has_value())
os << opt.value();
else
os << fallback;
os << "\n";
}
template <class T, class U>
void out_opt(const vector<optional<T>>& vec, const U& fallback, ostream& os = cout) {
for (auto it = vec.begin(); it != vec.end();) {
if ((*it).has_value())
os << (*it).value();
else
os << fallback;
if (++it != vec.end()) os << " ";
}
os << "\n";
}
namespace IO {
template <class T, class... U>
T read(U&&... u) {
T t = T(forward<U>(u)...);
in(t);
return t;
}
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u -= offset, v -= offset;
g[u].push_back(v);
if (!directed) g[v].push_back(u);
}
return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
vector<vector<pair<int, T>>> g(n);
for (int i = 0; i < m; i++) {
int u, v;
T w;
cin >> u >> v >> w;
u -= offset, v -= offset;
g[u].push_back({v, w});
if (!directed) g[v].push_back({u, w});
}
return g;
}
} // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
vector<vector<int>> g(n);
for (int i = 1; i < n; i++) {
int p;
cin >> p;
p -= offset;
if (to_root) g[i].push_back(p);
if (to_leaf) g[p].push_back(i);
}
return g;
}
} // namespace Tree
} // namespace IO
#line 10 "template/template.hpp"
#line 2 "template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int, T) {
cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
cerr << ":" << b << " ";
_show(i + 1, a, c...);
}
#line 2 "data-structure/range-add-range-positive-sum.hpp"
template <class T>
struct RangeAddRangePositiveSum {
RangeAddRangePositiveSum() {}
RangeAddRangePositiveSum(int n) : RangeAddRangePositiveSum(vector<T>(n)) {}
RangeAddRangePositiveSum(const vector<T>& a) : N(a.size()), B(max(1, (int)sqrt(N))), M((N + B - 1) / B), data(a), sorted(a), sorted_sum(N + M), lazy(M) {
for (int k = 0; k < M; k++) update_block(k);
}
void add(int l, int r, T v) {
if (l >= r) return;
int bl = l / B, br = (r - 1) / B;
if (bl == br) {
for (int i = l; i < r; i++) data[i] += v;
update_block(bl);
} else {
if (bl * B != l) {
bl++;
int l1 = bl * B;
while (l < l1) data[l++] += v;
update_block(bl - 1);
}
if (r < min(N, (br + 1) * B)) {
int r1 = br * B;
while (r1 < r) data[--r] += v;
update_block(br--);
}
for (int k = bl; k <= br; k++) lazy[k] += v;
}
}
T sum(int l, int r) const {
if (l >= r) return 0;
T ret = 0;
int bl = l / B, br = (r - 1) / B;
if (bl == br) {
for (int i = l; i < r; i++) ret += sum_point(i);
} else {
if (bl * B != l) {
bl++;
int l1 = bl * B;
while (l < l1) ret += sum_point(l++);
}
if (r < min(N, (br + 1) * B)) {
int r1 = br * B;
while (r1 < r) ret += sum_point(--r);
br--;
}
for (int k = bl; k <= br; k++) ret += sum_block(k);
}
return ret;
}
private:
int N, B, M;
vector<T> data, sorted, sorted_sum, lazy;
void update_block(int k) {
int l = B * k, r = min(N, l + B);
int sz = r - l;
copy(data.begin() + l, data.begin() + r, sorted.begin() + l);
sort(sorted.begin() + l, sorted.begin() + r);
auto it = sorted_sum.begin() + l + k;
*it = 0;
for (int i = 0; i < sz; i++)
*(it + i + 1) = *(it + i) + sorted[l + i];
}
T sum_point(int x) const { return max<T>(0, data[x] + lazy[x / B]); }
T sum_block(int k) const {
int l = B * k, r = min(N, l + B);
int sz = r - l;
auto itl = sorted.begin() + l;
int i = lower_bound(itl, itl + sz, -lazy[k]) - itl;
int l1 = l + k, r1 = l1 + sz;
return sorted_sum[r1] - sorted_sum[l1 + i] + lazy[k] * (sz - i);
}
};
/**
* @brief Range Add Range Positive Sum
* @docs docs/data-structure/range-add-range-positive-sum.md
*/
#line 2 "util/xorshift.hpp"
namespace XORShift {
unsigned int xor32() {
static unsigned int x = 123456789u;
x ^= x << 13, x ^= x >> 17, x ^= x << 5;
return x;
}
unsigned long long xor64() {
static unsigned long long x = 123456789ull;
x ^= x << 13, x ^= x >> 7, x ^= x << 17;
return x;
}
}; // namespace XORShift
/**
* @brief XOR shift
*/
#line 6 "verify/data-structure/UNIT_range_add_range_positive_sum.test.cpp"
long long naive_sum(const vector<long long>& a, int l, int r) {
long long ret = 0;
rep(i, l, r) ret += max(0LL, a[i]);
return ret;
}
void check_all(const RangeAddRangePositiveSum<long long>& ds, const vector<long long>& a) {
int n = a.size();
rep(l, 0, n + 1) rep(r, l, n + 1) {
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
void add_naive(vector<long long>& a, int l, int r, long long v) {
rep(i, l, r) a[i] += v;
}
pair<int, int> random_interval(int n) {
int l = n == 0 ? 0 : XORShift::xor32() % (n + 1);
int r = n == 0 ? 0 : XORShift::xor32() % (n + 1);
if (l > r) swap(l, r);
return {l, r};
}
void test_fixed() {
rep(n, 0, 80) {
vector<long long> a(n);
rep(i, 0, n) a[i] = i % 7 - 3;
RangeAddRangePositiveSum<long long> ds(a);
check_all(ds, a);
vector<tuple<int, int, long long>> qs;
qs.push_back({0, n, 5});
qs.push_back({0, min(n, 1), -10});
qs.push_back({n / 2, n, 4});
qs.push_back({0, n / 2, -3});
qs.push_back({n, n, 100});
if (n >= 2) qs.push_back({1, n - 1, 2});
for (auto [l, r, v] : qs) {
ds.add(l, r, v);
add_naive(a, l, r, v);
check_all(ds, a);
}
}
}
void test_random() {
rep(n, 0, 120) {
vector<long long> a(n);
rep(i, 0, n) a[i] = (long long)(XORShift::xor32() % 21) - 10;
RangeAddRangePositiveSum<long long> ds(a);
check_all(ds, a);
rep(_, 0, 500) {
auto [l, r] = random_interval(n);
if (XORShift::xor32() % 2) {
long long v = (long long)(XORShift::xor32() % 41) - 20;
ds.add(l, r, v);
add_naive(a, l, r, v);
} else {
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
check_all(ds, a);
}
}
void test_random_large() {
for (int n : {128, 257, 511, 1000, 2000}) {
vector<long long> a(n);
rep(i, 0, n) a[i] = (long long)(XORShift::xor32() % 2001) - 1000;
RangeAddRangePositiveSum<long long> ds(a);
rep(_, 0, 3000) {
auto [l, r] = random_interval(n);
if (XORShift::xor32() % 2) {
long long v = (long long)(XORShift::xor32() % 2001) - 1000;
ds.add(l, r, v);
add_naive(a, l, r, v);
} else {
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
rep(_, 0, 200) {
auto [l, r] = random_interval(n);
assert(ds.sum(l, r) == naive_sum(a, l, r));
}
}
}
int main() {
test_fixed();
test_random();
test_random_large();
int a, b;
in(a, b);
out(a + b);
}
verify/data-structure/UNIT_range_add_range_positive_sum.test.cpp
template/debug.hpp