結果
問題 | No.749 クエリ全部盛り |
ユーザー | maspy |
提出日時 | 2022-12-03 08:15:29 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 323 ms / 3,000 ms |
コード長 | 25,916 bytes |
コンパイル時間 | 3,911 ms |
コンパイル使用メモリ | 251,440 KB |
実行使用メモリ | 35,908 KB |
最終ジャッジ日時 | 2024-10-10 09:51:53 |
合計ジャッジ時間 | 6,543 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#line 1 "main.cpp"#define PROBLEM "https://yukicoder.me/problems/no/749"#line 1 "library/my_template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using pi = pair<ll, ll>;using vi = vector<ll>;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))#define overload4(a, b, c, d, e, ...) e#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) \overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stolltemplate <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())int popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T pick(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T pick(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T pick(pqg<T> &que) {assert(que.size());T a = que.top();que.pop();return a;}template <typename T>T pick(vc<T> &que) {assert(que.size());T a = que.back();que.pop_back();return a;}template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename F>ll binary_search(F check, ll ok, ll ng) {assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = S[i] - first_char; }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}template <typename CNT, typename T>vc<CNT> bincount(const vc<T> &A, int size) {vc<CNT> C(size);for (auto &&x: A) { ++C[x]; }return C;}// stabletemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(A.size());iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {int n = len(I);vc<T> B(n);FOR(i, n) B[i] = A[I[i]];return B;}#line 1 "library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace fastio {// クラスが read(), print() を持っているかを判定するメタ関数struct has_write_impl {template <class T>static auto check(T &&x) -> decltype(x.write(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {};struct has_read_impl {template <class T>static auto check(T &&x) -> decltype(x.read(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <typename T,typename enable_if<has_read<T>::value>::type * = nullptr>inline bool read_single(T &x) {x.read();return true;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <size_t N = 0, typename T>void read_single_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);read_single(x);read_single_tuple<N + 1>(t);}}template <class... T>bool read_single(tuple<T...> &tpl) {read_single_tuple(tpl);return true;}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char &val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string &s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double &x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double &x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}template <typename T,typename enable_if<has_write<T>::value>::type * = nullptr>inline void write(T x) {x.write();}template <class T>void write(const vector<T> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> &val) {write(val.first);write(' ');write(val.second);}template <size_t N = 0, typename T>void write_tuple(const T &t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { write(' '); }const auto &x = std::get<N>(t);write(x);write_tuple<N + 1>(t);}}template <class... T>bool write(tuple<T...> &tpl) {write_tuple(tpl);return true;}template <class T, size_t S>void write(const array<T, S> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if (val < 0) {negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if (negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}} // namespace fastiousing fastio::print;using fastio::flush;using fastio::read;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 2 "library/mod/modint.hpp"template <int mod>struct modint {int val;constexpr modint(const ll val = 0) noexcept: val(val >= 0 ? val % mod : (mod - (-val) % mod) % mod) {}bool operator<(const modint &other) const {return val < other.val;} // To use std::mapmodint &operator+=(const modint &p) {if ((val += p.val) >= mod) val -= mod;return *this;}modint &operator-=(const modint &p) {if ((val += mod - p.val) >= mod) val -= mod;return *this;}modint &operator*=(const modint &p) {val = (int)(1LL * val * p.val % mod);return *this;}modint &operator/=(const modint &p) {*this *= p.inverse();return *this;}modint operator-() const { return modint(-val); }modint operator+(const modint &p) const { return modint(*this) += p; }modint operator-(const modint &p) const { return modint(*this) -= p; }modint operator*(const modint &p) const { return modint(*this) *= p; }modint operator/(const modint &p) const { return modint(*this) /= p; }bool operator==(const modint &p) const { return val == p.val; }bool operator!=(const modint &p) const { return val != p.val; }modint inverse() const {int a = val, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return modint(u);}modint pow(int64_t n) const {modint ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}void write() { fastio::printer.write(val); }void read() { fastio::scanner.read(val); }static constexpr int get_mod() { return mod; }};struct ArbitraryModInt {static constexpr bool is_modint = true;int val;ArbitraryModInt() : val(0) {}ArbitraryModInt(int64_t y): val(y >= 0 ? y % get_mod(): (get_mod() - (-y) % get_mod()) % get_mod()) {}bool operator<(const ArbitraryModInt &other) const {return val < other.val;} // To use std::map<ArbitraryModInt, T>static int &get_mod() {static int mod = 0;return mod;}static void set_mod(int md) { get_mod() = md; }ArbitraryModInt &operator+=(const ArbitraryModInt &p) {if ((val += p.val) >= get_mod()) val -= get_mod();return *this;}ArbitraryModInt &operator-=(const ArbitraryModInt &p) {if ((val += get_mod() - p.val) >= get_mod()) val -= get_mod();return *this;}ArbitraryModInt &operator*=(const ArbitraryModInt &p) {long long a = (long long)val * p.val;int xh = (int)(a >> 32), xl = (int)a, d, m;asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(get_mod()));val = m;return *this;}ArbitraryModInt &operator/=(const ArbitraryModInt &p) {*this *= p.inverse();return *this;}ArbitraryModInt operator-() const { return ArbitraryModInt(get_mod() - val); }ArbitraryModInt operator+(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) += p;}ArbitraryModInt operator-(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) -= p;}ArbitraryModInt operator*(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) *= p;}ArbitraryModInt operator/(const ArbitraryModInt &p) const {return ArbitraryModInt(*this) /= p;}bool operator==(const ArbitraryModInt &p) const { return val == p.val; }bool operator!=(const ArbitraryModInt &p) const { return val != p.val; }ArbitraryModInt inverse() const {int a = val, b = get_mod(), u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return ArbitraryModInt(u);}ArbitraryModInt pow(int64_t n) const {ArbitraryModInt ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}void write() { fastio::printer.write(val); }void read() { fastio::scanner.read(val); }};template <typename mint>mint inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {0, 1};assert(0 <= n);if (n >= mod) n %= mod;while (int(dat.size()) <= n) {int k = dat.size();auto q = (mod + k - 1) / k;int r = k * q - mod;dat.emplace_back(dat[r] * mint(q));}return dat[n];}template <typename mint>mint fact(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {1, 1};assert(0 <= n);if (n >= mod) return 0;while (int(dat.size()) <= n) {int k = dat.size();dat.emplace_back(dat[k - 1] * mint(k));}return dat[n];}template <typename mint>mint fact_inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {1, 1};assert(-1 <= n && n < mod);if (n == -1) return mint(0);while (int(dat.size()) <= n) {int k = dat.size();dat.emplace_back(dat[k - 1] * inv<mint>(k));}return dat[n];}template <class mint, class... Ts>mint fact_invs(Ts... xs) {return (mint(1) * ... * fact_inv<mint>(xs));}template <typename mint, class Head, class... Tail>mint multinomial(Head &&head, Tail &&... tail) {return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);}template <typename mint>mint C_dense(int n, int k) {static vvc<mint> C;static int H = 0, W = 0;auto calc = [&](int i, int j) -> mint {if (i == 0) return (j == 0 ? mint(1) : mint(0));return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);};if (W <= k) {FOR(i, H) {C[i].resize(k + 1);FOR(j, W, k + 1) { C[i][j] = calc(i, j); }}W = k + 1;}if (H <= n) {C.resize(n + 1);FOR(i, H, n + 1) {C[i].resize(W);FOR(j, W) { C[i][j] = calc(i, j); }}H = n + 1;}return C[n][k];}template <typename mint, bool large = false, bool dense = false>mint C(ll n, ll k) {assert(n >= 0);if (k < 0 || n < k) return 0;if (dense) return C_dense<mint>(n, k);if (!large) return fact<mint>(n) * fact_inv<mint>(k) * fact_inv<mint>(n - k);k = min(k, n - k);mint x(1);FOR(i, k) { x *= mint(n - i); }x *= fact_inv<mint>(k);return x;}template <typename mint, bool large = false>mint C_inv(ll n, ll k) {assert(n >= 0);assert(0 <= k && k <= n);if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);return mint(1) / C<mint, 1>(n, k);}// [x^d] (1-x) ^ {-n} の計算template <typename mint, bool large = false, bool dense = false>mint C_negative(ll n, ll d) {assert(n >= 0);if (d < 0) return mint(0);if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }return C<mint, large, dense>(n + d - 1, d);}using modint107 = modint<1000000007>;using modint998 = modint<998244353>;using amint = ArbitraryModInt;#line 2 "library/ds/segtree/lazysegtree.hpp"template <typename ActedMonoid>struct LazySegTree {using Monoid_X = typename ActedMonoid::Monoid_X;using Monoid_A = typename ActedMonoid::Monoid_A;using X = typename Monoid_X::value_type;using A = typename Monoid_A::value_type;int n, log, size;vc<X> dat;vc<A> laz;LazySegTree() {}LazySegTree(int n) { build(n); }template <typename F>LazySegTree(int n, F f) {build(n, f);}LazySegTree(vc<X> v) { build(v); }void build(int m) {build(m, [](int i) -> X { return Monoid_X::unit(); });}void build(vc<X> v) {build(len(v), [&](int i) -> X { return v[i]; });}template <typename F>void build(int m, F f) {n = m, log = 1;while ((1 << log) < n) ++log;size = 1 << log;dat.assign(size << 1, Monoid_X::unit());laz.assign(size, Monoid_A::unit());FOR(i, n) dat[size + i] = f(i);FOR_R(i, 1, size) update(i);}void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); }void apply_at(int k, A a) {int sz = 1 << (log - topbit(k));dat[k] = ActedMonoid::act(dat[k], a, sz);if (k < size) laz[k] = Monoid_A::op(laz[k], a);}void push(int k) {apply_at(2 * k, laz[k]);apply_at(2 * k + 1, laz[k]);laz[k] = Monoid_A::unit();}void set(int p, X x) {assert(0 <= p && p < n);p += size;for (int i = log; i >= 1; i--) push(p >> i);dat[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}X get(int p) {assert(0 <= p && p < n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return dat[p];}vc<X> get_all() {for (int i = log; i >= 1; i--) {FOR(k, size >> i, (size + size) >> i) { push(k); }}return {dat.begin() + size, dat.begin() + size + n};}X prod(int l, int r) {assert(0 <= l && l <= r && r <= n);if (l == r) return Monoid_X::unit();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);}X xl = Monoid_X::unit(), xr = Monoid_X::unit();while (l < r) {if (l & 1) xl = Monoid_X::op(xl, dat[l++]);if (r & 1) xr = Monoid_X::op(dat[--r], xr);l >>= 1;r >>= 1;}return Monoid_X::op(xl, xr);}X prod_all() { return dat[1]; }void apply(int l, int r, A a) {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) apply_at(l++, a);if (r & 1) apply_at(--r, a);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 <typename C>int max_right(C& check, int l) {assert(0 <= l && l <= n);assert(check(Monoid_X::unit()));if (l == n) return n;l += size;for (int i = log; i >= 1; i--) push(l >> i);X sm = Monoid_X::unit();do {while (l % 2 == 0) l >>= 1;if (!check(Monoid_X::op(sm, dat[l]))) {while (l < size) {push(l);l = (2 * l);if (check(Monoid_X::op(sm, dat[l]))) {sm = Monoid_X::op(sm, dat[l]);l++;}}return l - size;}sm = Monoid_X::op(sm, dat[l]);l++;} while ((l & -l) != l);return n;}template <typename C>int min_left(C& check, int r) {assert(0 <= r && r <= n);assert(check(Monoid_X::unit()));if (r == 0) return 0;r += size;for (int i = log; i >= 1; i--) push((r - 1) >> i);X sm = Monoid_X::unit();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!check(Monoid_X::op(dat[r], sm))) {while (r < size) {push(r);r = (2 * r + 1);if (check(Monoid_X::op(dat[r], sm))) {sm = Monoid_X::op(dat[r], sm);r--;}}return r + 1 - size;}sm = Monoid_X::op(dat[r], sm);} while ((r & -r) != r);return 0;}*/};#line 2 "library/alg/monoid/add_pair.hpp"template <typename E>struct Monoid_Add_Pair {using value_type = pair<E, E>;using X = value_type;static constexpr X op(const X &x, const X &y) {return {x.fi + y.fi, x.se + y.se};}static constexpr X inverse(const X &x) { return {-x.fi, -x.se}; }static constexpr X unit() { return {0, 0}; }static constexpr bool commute = true;};#line 7 "main.cpp"using mint = modint107;// (a, fsum)using MonoX = Monoid_Add_Pair<mint>;// pa + q + rf, fstruct MonoA {using value_type = tuple<mint, mint, mint>;using X = value_type;static X op(X x, X y) {auto [a, b, c] = y;auto [d, e, f] = x;return {a * d, a * e + b, a * f + c};}static constexpr X unit() { return {mint(1), mint(0), mint(0)}; }static constexpr bool commute = true;};struct AM {using Monoid_X = MonoX;using Monoid_A = MonoA;using X = typename Monoid_X::value_type;using A = typename Monoid_A::value_type;static X act(const X &x, const A &a, const ll &size) {auto [sum, fsum] = x;auto [p, q, r] = a;return {p * sum + q * mint(size) + r * fsum, fsum};}};void solve() {LL(N, Q);vc<mint> F(N);F[1] = 1;FOR3(i, 2, N) F[i] = F[i - 2] + F[i - 1];LazySegTree<AM> seg(N, [&](int i) -> typename MonoX::value_type {return {mint(0), F[i]};});FOR(Q) {LL(t, L, R, k);++R;if (t == 0) { print(seg.prod(L, R).fi * mint(k)); }if (t == 1) { seg.apply(L, R, {mint(0), mint(k), mint(0)}); }if (t == 2) { seg.apply(L, R, {mint(1), mint(k), mint(0)}); }if (t == 3) { seg.apply(L, R, {mint(k), mint(0), mint(0)}); }if (t == 4) { seg.apply(L, R, {mint(1), mint(0), mint(k)}); }}}signed main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << setprecision(15);ll T = 1;// LL(T);FOR(_, T) solve();return 0;}