結果

問題 No.749 クエリ全部盛り
ユーザー risujirohrisujiroh
提出日時 2018-10-24 02:17:41
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 385 ms / 3,000 ms
コード長 3,638 bytes
コンパイル時間 1,840 ms
コンパイル使用メモリ 176,644 KB
実行使用メモリ 81,408 KB
最終ジャッジ日時 2024-11-19 04:49:14
合計ジャッジ時間 4,900 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:39:15: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   39 |   SegmentTree(auto first, auto last) : n(distance(first, last)), val(2 * n, Monoid::e()), act(n, MonoidAct::id()), len(2 * n, 1) {
      |               ^~~~
main.cpp:39:27: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   39 |   SegmentTree(auto first, auto last) : n(distance(first, last)), val(2 * n, Monoid::e()), act(n, MonoidAct::id()), len(2 * n, 1) {
      |                           ^~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }
constexpr lint mod = 1e9 + 7;
inline lint emod(lint a, lint p = mod) { return (a % p + p) % p; }
struct Monoid {
using T = struct { lint v, fib; };
static T op(const T& lhs, const T& rhs) { return {(lhs.v + rhs.v) % mod, (lhs.fib + rhs.fib) % mod}; }
static constexpr T e() { return {0, 0}; }
};
template<class Monoid> struct MonoidAct {
using T = struct { lint a, b, c; };
static void ap(const T& f, typename Monoid::T& a, int len) { a.v = (f.a * a.v + f.b * len + f.c * a.fib) % mod; }
static void cp(const T& f, T& g) { (g.a *= f.a) %= mod, g.b = (f.a * g.b + f.b) % mod, g.c = (f.a * g.c + f.c) % mod; }
static constexpr T id() { return {1, 0, 0}; }
};
template<class Monoid, class MonoidAct> struct SegmentTree {
using Tv = typename Monoid::T;
using Ta = typename MonoidAct::T;
int n;
V<Tv> val;
V<Ta> act;
V<> len;
SegmentTree(int n) : n(n), val(2 * n, Monoid::e()), act(n, MonoidAct::id()), len(2 * n, 1) {
for (int i = n - 1; i > 0; --i) len[i] = len[2 * i] + len[2 * i + 1];
}
SegmentTree(auto first, auto last) : n(distance(first, last)), val(2 * n, Monoid::e()), act(n, MonoidAct::id()), len(2 * n, 1) {
copy(first, last, next(begin(val), n));
build();
for (int i = n - 1; i > 0; --i) len[i] = len[2 * i] + len[2 * i + 1];
}
void _ap(const Ta& f, int i) {
MonoidAct::ap(f, val[i], len[i]);
if (i < n) MonoidAct::cp(f, act[i]);
}
void build() {
for (int i = n - 1; i > 0; --i) val[i] = Monoid::op(val[2 * i], val[2 * i + 1]);
}
Tv get(int l, int r) {
_push(l, r);
Tv resl = Monoid::e(), resr = Monoid::e();
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1) resl = Monoid::op(resl, val[l++]);
if (r & 1) resr = Monoid::op(val[--r], resr);
}
return Monoid::op(resl, resr);
}
void push() {
for (int i = 1; i < n; ++i) _push(i);
}
void _push(int i) {
_ap(act[i], 2 * i);
_ap(act[i], 2 * i + 1);
act[i] = MonoidAct::id();
}
void _push(int l, int r) {
for (int hl = __lg(l + n), hr = __lg(r - 1 + n); hr > 0; --hl, --hr) {
int al = l + n >> hl, ar = r - 1 + n >> hr;
if (al < n) _push(al);
if (ar != al) _push(ar);
}
}
void set(int l, int r, const Ta& f) {
_push(l, r);
for (int i = l + n, j = r + n; i < j; i >>= 1, j >>= 1) {
if (i & 1) _ap(f, i++);
if (j & 1) _ap(f, --j);
}
for (l += n; !(l & 1); l >>= 1);
while ((l >>= 1) > 0) val[l] = Monoid::op(val[2 * l], val[2 * l + 1]);
for (r += n; !(r & 1); r >>= 1);
while ((r >>= 1) > 0) val[r] = Monoid::op(val[2 * r], val[2 * r + 1]);
}
};
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int n, Q; cin >> n >> Q;
V<Monoid::T> v(n);
v[1].fib = 1;
for (int i = 2; i < n; ++i) v[i].fib = (v[i - 1].fib + v[i - 2].fib) % mod;
SegmentTree< Monoid, MonoidAct<Monoid> > st(begin(v), end(v));
for (int i = 0; i < Q; ++i) {
int q, l, r, k; cin >> q >> l >> r >> k, ++r;
switch (q) {
case 0: cout << emod(k * st.get(l, r).v) << '\n'; break;
case 1: st.set(l, r, {0, k, 0}); break;
case 2: st.set(l, r, {1, k, 0}); break;
case 3: st.set(l, r, {k, 0, 0}); break;
case 4: st.set(l, r, {1, 0, k}); break;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
1