minmax_add.test.cpp

#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"
#include "alg/acted_monoid/minmax_add.hpp"
#include "random/base.hpp"
#include "ds/segtree/lazy_segtree.hpp"

void test() {
  int N = RNG(1, 100);
  vc<int> A(N);
  FOR(i, N) A[i] = RNG(1, 100);
  using AM = ActedMonoid_MinMax_Add<int>;
  using Mono = typename AM::Monoid_X;
  Lazy_SegTree<AM> seg(N, [&](int i) { return Mono::from_element(A[i]); });
  int Q = RNG(1, 100);
  FOR(Q) {
    ll t = RNG(0, 2);
    ll L = RNG(0, N);
    ll R = RNG(0, N);
    if (L > R) swap(L, R);
    ++R;
    if (t == 1) {
      ll x = RNG(1, 100);
      FOR(i, L, R) A[i] += x;
      seg.apply(L, R, x);
    }
    if (t == 2) {
      vc<int> B = {A.begin() + L, A.begin() + R};
      assert(seg.prod(L, R) == mp(MIN(B), MAX(B)));
    }
  }
}

void solve() {
  int a, b;
  cin >> a >> b;
  cout << a + b << "\n";
}

signed main() {
  FOR(100) test();
  solve();

  return 0;
}