This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/880
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// beats!
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdint>
#include "src/DataStructure/SegmentTree.hpp"
using namespace std;
struct Mono {
struct T {
uint64_t max, sum, lcm;
};
static T ti() { return {0, 0, 1}; }
static T op(const T &vl, const T &vr) { return {max(vl.max, vr.max), vl.sum + vr.sum, min(1ull * lcm(vl.lcm, vr.lcm), 1ull << 60)}; }
struct E {
uint32_t upd, gcd;
};
static bool mp(T &v, const E &f, int sz) {
if (f.gcd == 0) return v.sum= (v.lcm= v.max= f.upd) * sz, true;
if (f.gcd % v.lcm == 0) return true;
if (v.max * sz != v.sum) return false;
return v.sum= (v.lcm= v.max= gcd(v.max, f.gcd)) * sz, true;
}
static void cp(E &pre, const E &suf) {
if (pre.gcd != 0 && suf.gcd != 0) pre.gcd= gcd(pre.gcd, suf.gcd);
else pre= {suf.gcd == 0 ? suf.upd : gcd(pre.upd, suf.gcd), 0};
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
SegmentTree<Mono> seg(N);
for (int i= 0; i < N; i++) {
unsigned a;
cin >> a;
seg.unsafe_set(i, {a, a, a});
}
seg.build();
while (Q--) {
int op, l, r;
cin >> op >> l >> r, l--;
if (op < 3) {
unsigned x;
cin >> x;
if (op == 1) seg.apply(l, r, {x, 0});
if (op == 2) seg.apply(l, r, {0, x});
} else {
if (op == 3) cout << seg.prod(l, r).max << '\n';
if (op == 4) cout << seg.prod(l, r).sum << '\n';
}
}
return 0;
}
#line 1 "test/yukicoder/880.Beats.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/880
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// beats!
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cstdint>
#line 2 "src/DataStructure/SegmentTree.hpp"
#include <memory>
#include <cassert>
#include <vector>
#line 2 "src/Internal/detection_idiom.hpp"
#include <type_traits>
#define _DETECT_BOOL(name, ...) \
template <class, class= void> struct name: std::false_type {}; \
template <class T> struct name<T, std::void_t<__VA_ARGS__>>: std::true_type {}; \
template <class T> static constexpr bool name##_v= name<T>::value
#define _DETECT_TYPE(name, type1, type2, ...) \
template <class T, class= void> struct name { \
using type= type2; \
}; \
template <class T> struct name<T, std::void_t<__VA_ARGS__>> { \
using type= type1; \
}
#line 7 "src/DataStructure/SegmentTree.hpp"
template <class M> class SegmentTree {
_DETECT_BOOL(monoid, typename T::T, decltype(&T::op), decltype(&T::ti));
_DETECT_BOOL(dual, typename T::T, typename T::E, decltype(&T::mp), decltype(&T::cp));
_DETECT_TYPE(nullptr_or_E, typename T::E, std::nullptr_t, typename T::E);
using T= typename M::T;
using E= typename nullptr_or_E<M>::type;
int n;
std::unique_ptr<T[]> dat;
std::unique_ptr<E[]> laz;
std::unique_ptr<bool[]> flg;
inline void update(int k) { dat[k]= M::op(dat[k << 1], dat[k << 1 | 1]); }
inline bool map(int k, E x, int sz) {
if constexpr (std::is_invocable_r_v<bool, decltype(M::mp), T &, E, int>) return M::mp(dat[k], x, sz);
else if constexpr (std::is_invocable_r_v<bool, decltype(M::mp), T &, E>) return M::mp(dat[k], x);
else if constexpr (std::is_invocable_r_v<void, decltype(M::mp), T &, E, int>) return M::mp(dat[k], x, sz), true;
else return M::mp(dat[k], x), true;
}
inline void prop(int k, E x, int sz) {
if (k < n) {
if (flg[k]) M::cp(laz[k], x);
else laz[k]= x;
flg[k]= true;
if constexpr (monoid_v<M>)
if (!map(k, x, sz)) push(k, sz), update(k);
} else {
if constexpr (monoid_v<M>) map(k, x, 1);
else map(k - n, x, 1);
}
}
inline void push(int k, int sz) {
if (flg[k]) prop(k << 1, laz[k], sz >> 1), prop(k << 1 | 1, laz[k], sz >> 1), flg[k]= false;
}
inline bool valid(int k) const {
int d= __builtin_clz(k) - __builtin_clz(n);
return (n >> d) != k || ((n >> d) << d) == n;
}
public:
SegmentTree() {}
SegmentTree(int n): n(n), dat(std::make_unique<T[]>(n << monoid_v<M>)) {
if constexpr (monoid_v<M>) std::fill_n(dat.get(), n << 1, M::ti());
if constexpr (dual_v<M>) laz= std::make_unique<E[]>(n), flg= std::make_unique<bool[]>(n), std::fill_n(flg.get(), n, false);
}
template <class F> SegmentTree(int n, const F &init): n(n), dat(std::make_unique<T[]>(n << monoid_v<M>)) {
auto a= dat.get() + (n & -monoid_v<M>);
for (int i= 0; i < n; ++i) a[i]= init(i);
if constexpr (monoid_v<M>) build();
if constexpr (dual_v<M>) laz= std::make_unique<E[]>(n), flg= std::make_unique<bool[]>(n), std::fill_n(flg.get(), n, false);
}
SegmentTree(int n, T x): SegmentTree(n, [x](int) { return x; }) {}
SegmentTree(const std::vector<T> &v): SegmentTree(v.size(), [&v](int i) { return v[i]; }) {}
SegmentTree(const T *bg, const T *ed): SegmentTree(ed - bg, [bg](int i) { return bg[i]; }) {}
void build() {
static_assert(monoid_v<M>, "\"build\" is not available\n");
for (int i= n; --i;) update(i);
}
inline void unsafe_set(int i, T x) {
static_assert(monoid_v<M>, "\"unsafe_set\" is not available\n");
dat[i + n]= x;
}
inline void set(int i, T x) {
get(i);
if constexpr (monoid_v<M>)
for (dat[i+= n]= x; i>>= 1;) update(i);
else dat[i]= x;
}
inline void mul(int i, T x) {
static_assert(monoid_v<M>, "\"mul\" is not available\n");
set(i, M::op(get(i), x));
}
inline T get(int i) {
i+= n;
if constexpr (dual_v<M>)
for (int j= 31 - __builtin_clz(i); j; --j) push(i >> j, 1 << j);
if constexpr (monoid_v<M>) return dat[i];
else return dat[i - n];
}
inline T operator[](int i) { return get(i); }
inline T prod(int l, int r) {
static_assert(monoid_v<M>, "\"prod\" is not available\n");
l+= n, r+= n;
if constexpr (dual_v<M>) {
for (int j= 31 - __builtin_clz(l); ((l >> j) << j) != l; --j) push(l >> j, 1 << j);
for (int j= 31 - __builtin_clz(r); ((r >> j) << j) != r; --j) push(r >> j, 1 << j);
}
T s1= M::ti(), s2= M::ti();
for (; l < r; l>>= 1, r>>= 1) {
if (l & 1) s1= M::op(s1, dat[l++]);
if (r & 1) s2= M::op(dat[--r], s2);
}
return M::op(s1, s2);
}
inline void apply(int l, int r, E x) {
static_assert(dual_v<M>, "\"apply\" is not available\n");
l+= n, r+= n;
for (int j= 31 - __builtin_clz(l); ((l >> j) << j) != l; j--) push(l >> j, 1 << j);
for (int j= 31 - __builtin_clz(r); ((r >> j) << j) != r; j--) push(r >> j, 1 << j);
for (int a= l, b= r, sz= 1; a < b; a>>= 1, b>>= 1, sz<<= 1) {
if (a & 1) prop(a++, x, sz);
if (b & 1) prop(--b, x, sz);
}
if constexpr (monoid_v<M>) {
for (int j= __builtin_ctz(l) + 1; l >> j; ++j) update(l >> j);
for (int j= __builtin_ctz(r) + 1; r >> j; ++j) update(r >> j);
}
}
template <class C> int max_right(int l, const C &check) {
static_assert(monoid_v<M>, "\"max_right\" is not available\n");
assert(check(M::ti()));
if (check(prod(l, n))) return n;
T s= M::ti(), t;
int sz= 1;
for (get(l), l+= n;; s= t, ++l) {
while (!(l & 1) && valid(l >> 1)) l>>= 1, sz<<= 1;
if (!check(t= M::op(s, dat[l]))) {
while (l < n) {
if constexpr (dual_v<M>) push(l, sz);
l<<= 1, sz>>= 1;
if (check(t= M::op(s, dat[l]))) s= t, ++l;
}
return l - n;
}
}
}
template <class C> int min_left(int r, const C &check) {
static_assert(monoid_v<M>, "\"min_left\" is not available\n");
assert(check(M::ti()));
if (check(prod(0, r))) return 0;
T s= M::ti(), t;
int sz= 1;
for (get(--r), r+= n;; s= t, --r) {
while (!valid(r)) r= r << 1 | 1, sz>>= 1;
while ((r & 1) && valid(r >> 1)) r>>= 1, sz<<= 1;
if (!check(t= M::op(dat[r], s))) {
while (r < n) {
if constexpr (dual_v<M>) push(r, sz);
r= r << 1 | 1, sz>>= 1;
if (check(t= M::op(dat[r], s))) s= t, --r;
}
return r + 1 - n;
}
}
}
};
#line 10 "test/yukicoder/880.Beats.test.cpp"
using namespace std;
struct Mono {
struct T {
uint64_t max, sum, lcm;
};
static T ti() { return {0, 0, 1}; }
static T op(const T &vl, const T &vr) { return {max(vl.max, vr.max), vl.sum + vr.sum, min(1ull * lcm(vl.lcm, vr.lcm), 1ull << 60)}; }
struct E {
uint32_t upd, gcd;
};
static bool mp(T &v, const E &f, int sz) {
if (f.gcd == 0) return v.sum= (v.lcm= v.max= f.upd) * sz, true;
if (f.gcd % v.lcm == 0) return true;
if (v.max * sz != v.sum) return false;
return v.sum= (v.lcm= v.max= gcd(v.max, f.gcd)) * sz, true;
}
static void cp(E &pre, const E &suf) {
if (pre.gcd != 0 && suf.gcd != 0) pre.gcd= gcd(pre.gcd, suf.gcd);
else pre= {suf.gcd == 0 ? suf.upd : gcd(pre.upd, suf.gcd), 0};
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
SegmentTree<Mono> seg(N);
for (int i= 0; i < N; i++) {
unsigned a;
cin >> a;
seg.unsafe_set(i, {a, a, a});
}
seg.build();
while (Q--) {
int op, l, r;
cin >> op >> l >> r, l--;
if (op < 3) {
unsigned x;
cin >> x;
if (op == 1) seg.apply(l, r, {x, 0});
if (op == 2) seg.apply(l, r, {0, x});
} else {
if (op == 3) cout << seg.prod(l, r).max << '\n';
if (op == 4) cout << seg.prod(l, r).sum << '\n';
}
}
return 0;
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++-13 | 00_sample_01 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_01 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_02 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_03 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_04 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_05 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_06 |
![]() |
5 ms | 4 MB |
g++-13 | 22_random_07 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_08 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_09 |
![]() |
6 ms | 4 MB |
g++-13 | 22_random_10 |
![]() |
6 ms | 4 MB |
g++-13 | 33_large_01 |
![]() |
193 ms | 8 MB |
g++-13 | 33_large_02 |
![]() |
191 ms | 8 MB |
g++-13 | 33_large_03 |
![]() |
137 ms | 8 MB |
g++-13 | 43_max_01 |
![]() |
187 ms | 9 MB |
g++-13 | 43_max_02 |
![]() |
198 ms | 9 MB |
g++-13 | 43_max_03 |
![]() |
208 ms | 9 MB |
g++-13 | 48_fib_01 |
![]() |
157 ms | 9 MB |
g++-13 | 48_fib_02 |
![]() |
156 ms | 9 MB |
g++-13 | 63_primes_01 |
![]() |
117 ms | 9 MB |
g++-13 | 63_primes_02 |
![]() |
120 ms | 9 MB |
g++-13 | 63_primes_03 |
![]() |
121 ms | 8 MB |
g++-13 | 63_primes_04 |
![]() |
115 ms | 9 MB |
g++-13 | 63_primes_05 |
![]() |
119 ms | 9 MB |
g++-13 | 64_primes2_01 |
![]() |
101 ms | 9 MB |
g++-13 | 64_primes2_02 |
![]() |
103 ms | 9 MB |
g++-13 | 64_primes2_03 |
![]() |
108 ms | 9 MB |
g++-13 | 64_primes2_04 |
![]() |
102 ms | 9 MB |
g++-13 | 64_primes2_05 |
![]() |
107 ms | 9 MB |
g++-13 | 71_even_01 |
![]() |
186 ms | 9 MB |
g++-13 | 71_even_02 |
![]() |
195 ms | 9 MB |
g++-13 | 71_even_03 |
![]() |
207 ms | 9 MB |
g++-13 | 98_challenge01.txt |
![]() |
54 ms | 9 MB |
g++-13 | 98_challenge02.txt |
![]() |
56 ms | 9 MB |
g++-13 | 99_killer_01 |
![]() |
93 ms | 9 MB |
g++-13 | 99_killer_02 |
![]() |
100 ms | 9 MB |
g++-13 | 99_killer_03 |
![]() |
95 ms | 9 MB |
g++-13 | 99_killer_04 |
![]() |
93 ms | 9 MB |
g++-13 | 99_killer_05 |
![]() |
94 ms | 9 MB |
clang++-18 | 00_sample_01 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_01 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_02 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_03 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_04 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_05 |
![]() |
5 ms | 4 MB |
clang++-18 | 22_random_06 |
![]() |
5 ms | 4 MB |
clang++-18 | 22_random_07 |
![]() |
5 ms | 4 MB |
clang++-18 | 22_random_08 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_09 |
![]() |
6 ms | 4 MB |
clang++-18 | 22_random_10 |
![]() |
5 ms | 4 MB |
clang++-18 | 33_large_01 |
![]() |
202 ms | 8 MB |
clang++-18 | 33_large_02 |
![]() |
199 ms | 8 MB |
clang++-18 | 33_large_03 |
![]() |
143 ms | 8 MB |
clang++-18 | 43_max_01 |
![]() |
195 ms | 9 MB |
clang++-18 | 43_max_02 |
![]() |
203 ms | 9 MB |
clang++-18 | 43_max_03 |
![]() |
215 ms | 9 MB |
clang++-18 | 48_fib_01 |
![]() |
174 ms | 9 MB |
clang++-18 | 48_fib_02 |
![]() |
173 ms | 9 MB |
clang++-18 | 63_primes_01 |
![]() |
110 ms | 9 MB |
clang++-18 | 63_primes_02 |
![]() |
109 ms | 9 MB |
clang++-18 | 63_primes_03 |
![]() |
113 ms | 9 MB |
clang++-18 | 63_primes_04 |
![]() |
107 ms | 9 MB |
clang++-18 | 63_primes_05 |
![]() |
115 ms | 9 MB |
clang++-18 | 64_primes2_01 |
![]() |
98 ms | 9 MB |
clang++-18 | 64_primes2_02 |
![]() |
101 ms | 9 MB |
clang++-18 | 64_primes2_03 |
![]() |
107 ms | 8 MB |
clang++-18 | 64_primes2_04 |
![]() |
101 ms | 9 MB |
clang++-18 | 64_primes2_05 |
![]() |
104 ms | 9 MB |
clang++-18 | 71_even_01 |
![]() |
190 ms | 9 MB |
clang++-18 | 71_even_02 |
![]() |
199 ms | 9 MB |
clang++-18 | 71_even_03 |
![]() |
214 ms | 9 MB |
clang++-18 | 98_challenge01.txt |
![]() |
56 ms | 9 MB |
clang++-18 | 98_challenge02.txt |
![]() |
58 ms | 9 MB |
clang++-18 | 99_killer_01 |
![]() |
92 ms | 9 MB |
clang++-18 | 99_killer_02 |
![]() |
98 ms | 9 MB |
clang++-18 | 99_killer_03 |
![]() |
94 ms | 9 MB |
clang++-18 | 99_killer_04 |
![]() |
95 ms | 9 MB |
clang++-18 | 99_killer_05 |
![]() |
93 ms | 9 MB |