#include #include #include #include using namespace std; #ifndef ATCODER_INTERNAL_BITOP_HPP #define ATCODER_INTERNAL_BITOP_HPP 1 #ifdef _MSC_VER #include #endif namespace atcoder { namespace internal { // @param n `0 <= n` // @return minimum non-negative `x` s.t. `n <= 2**x` int ceil_pow2(int n) { int x = 0; while ((1U << x) < (unsigned int)(n)) x++; return x; } // @param n `1 <= n` // @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0` int bsf(unsigned int n) { #ifdef _MSC_VER unsigned long index; _BitScanForward(&index, n); return index; #else return __builtin_ctz(n); #endif } } // namespace internal } // namespace atcoder #endif // ATCODER_INTERNAL_BITOP_HPP #ifndef ATCODER_LAZYSEGTREE_HPP #define ATCODER_LAZYSEGTREE_HPP 1 #include #include #include #include // #include "atcoder/internal_bit" namespace atcoder { template struct lazy_segtree { public: lazy_segtree() : lazy_segtree(0) {} lazy_segtree(int n) : lazy_segtree(std::vector(n, e())) {} lazy_segtree(const std::vector& v) : _n(int(v.size())) { log = internal::ceil_pow2(_n); size = 1 << log; d = std::vector(2 * size, e()); lz = std::vector(size, id()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); return d[p]; } S prod(int l, int r) { assert(0 <= l && l <= r && r <= _n); if (l == r) return e(); l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push(r >> i); } S sml = e(), smr = e(); while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() { return d[1]; } void apply(int p, F f) { assert(0 <= p && p < _n); p += size; for (int i = log; i >= 1; i--) push(p >> i); d[p] = mapping(f, d[p]); for (int i = 1; i <= log; i++) update(p >> i); } void apply(int l, int r, F f) { assert(0 <= l && l <= r && r <= _n); if (l == r) return; l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } { int l2 = l, r2 = r; while (l < r) { if (l & 1) all_apply(l++, f); if (r & 1) all_apply(--r, f); l >>= 1; r >>= 1; } l = l2; r = r2; } for (int i = 1; i <= log; i++) { if (((l >> i) << i) != l) update(l >> i); if (((r >> i) << i) != r) update((r - 1) >> i); } } template int max_right(int l) { return max_right(l, [](S x) { return g(x); }); } template int max_right(int l, G g) { assert(0 <= l && l <= _n); assert(g(e())); if (l == _n) return _n; l += size; for (int i = log; i >= 1; i--) push(l >> i); S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!g(op(sm, d[l]))) { while (l < size) { push(l); l = (2 * l); if (g(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template int min_left(int r) { return min_left(r, [](S x) { return g(x); }); } template int min_left(int r, G g) { assert(0 <= r && r <= _n); assert(g(e())); if (r == 0) return 0; r += size; for (int i = log; i >= 1; i--) push((r - 1) >> i); S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!g(op(d[r], sm))) { while (r < size) { push(r); r = (2 * r + 1); if (g(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } protected: // Modified int _n, size, log; std::vector d; std::vector lz; void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } virtual void all_apply(int k, F f) { // Modified d[k] = mapping(f, d[k]); if (k < size) lz[k] = composition(f, lz[k]); } void push(int k) { all_apply(2 * k, lz[k]); all_apply(2 * k + 1, lz[k]); lz[k] = id(); } }; } // namespace atcoder #endif // ATCODER_LAZYSEGTREE_HPP template class segtree_beats : public atcoder::lazy_segtree { using Base = atcoder::lazy_segtree; using Base::lazy_segtree; void all_apply(int k, F f) override { Base::d[k] = mapping(f, this->d[k]); if (k < Base::size) { Base::lz[k] = composition(f, Base::lz[k]); if (Base::d[k].fail) Base::push(k), Base::update(k); } } }; using BNum = int; constexpr BNum BINF = 1 << 30; struct BNode { BNum hi; long long sum; BNum lcm; unsigned sz; bool fail; bool all_same; BNode() : hi(0), sum(0), lcm(1), fail(0), all_same(0) {} BNode(BNum x, unsigned sz_ = 1) : hi(x), sum((long long)x * sz_), lcm(x), sz(sz_), fail(0), all_same(1) {} }; BNode be() { return BNode(); } BNode bop(BNode l, BNode r) { if (r.sz == 0) return l; if (l.sz == 0) return r; BNode ret; ret.hi = std::max(l.hi, r.hi); ret.sum = l.sum + r.sum; if (l.lcm >= BINF or r.lcm >= BINF) ret.lcm = BINF; else ret.lcm = min(BINF, std::lcm(l.lcm, r.lcm)); ret.sz = l.sz + r.sz; if (l.all_same and r.all_same and l.hi == r.hi) ret.all_same = true; return ret; } struct BF { BNum dogcd, reset; BF() : dogcd(0), reset(0) {} BF(BNum g, BNum upd) : dogcd(g), reset(upd) {} }; BF bcomposition(BF fnew, BF fold) { BF ret; if (fnew.reset) return fnew; else return BF(__gcd(fnew.dogcd, fold.dogcd), fold.reset); } BF bid() { return BF(); } BNode bmapping(BF f, BNode x) { if (x.fail) return x; if (f.reset) x = BNode(f.reset, x.sz); if (f.dogcd) { if (x.all_same) x = BNode(__gcd(f.dogcd, x.hi), x.sz); else if (f.dogcd and (x.lcm == BINF or f.dogcd % x.lcm)) x.fail = true; } return x; } int main() { cin.tie(0), ios::sync_with_stdio(false); int N, Q; cin >> N >> Q; vector A(N); for (auto &a : A) { int tmp; cin >> tmp; a = BNode(tmp); } segtree_beats segtree(A); int q, l, r, x; while (Q--) { cin >> q >> l >> r; l--; if (q <= 2) { cin >> x; if (q == 1) segtree.apply(l, r, BF(0, x)); if (q == 2) segtree.apply(l, r, BF(x, 0)); } else { auto v = segtree.prod(l, r); if (q == 3) cout << v.hi << '\n'; if (q == 4) cout << v.sum << '\n'; } } }