/
maxidx_add.test.cpp
49 lines (45 loc) · 1.02 KB
/
maxidx_add.test.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"
#include "alg/acted_monoid/maxidx_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_MaxIdx_Add<int>;
using Mono = typename AM::Monoid_X;
Lazy_SegTree<AM> seg(N, [&](int i) -> typename Mono::value_type {
return {A[i], 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};
int mx = MAX(B);
int idx = -1;
FOR_R(i, L, R) if (A[i] == mx) idx = i;
assert(seg.prod(L, R) == mp(mx, idx));
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
FOR(100) test();
solve();
return 0;
}