#320616 (C++14) No.749 クエリ全部盛り

• 問題: No.749 クエリ全部盛り
• ユーザー: jell
• 提出日時: 2019-03-03 13:51:44
• 言語: C++14 (gcc 13.3.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 662 ms / 3,000 ms
• コード長: 10,116 bytes
• コンパイル時間: 1,331 ms
• コンパイル使用メモリ: 121,804 KB
• 実行使用メモリ: 134,828 KB
• 最終ジャッジ日時: 2024-06-23 13:12:20
• 合計ジャッジ時間: 6,621 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
other	AC * 20

ソースコード

#include <stdlib.h>
#include <assert.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <complex>
#include <iomanip>
#include <bitset>
#include <random>

using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
using pdi = pair<double, int>;
template <class T> using vct = vector<T>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / 4 - 1;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;

#define mod 1000000007
#define stdout_precision 10
#define stderr_precision 2
#define itr(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritr(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define fro front
#define bac back
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

struct setupper {
    setupper() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        std::cout.tie(nullptr);
        std::cerr.tie(nullptr);
        std::cout << fixed << setprecision(stdout_precision);
        std::cerr << fixed << setprecision(stderr_precision);
// #ifdef Local
//         std::cerr << "\n---stderr---\n";
//         auto print_atexit = []() {
//             std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
//             std::cerr << "------------\n";
//         };
//         atexit((void(*)())print_atexit);
// #endif
    }
} setupper_;

namespace std {
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
    for(size_t i = 0; i < v.size(); ++i) s << (i ? " " : "") << v[i];
    return s;
}
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T = int> T read() { T x; return cin >> x, x; }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)

namespace updater {
    template <class T> static void add(T &x, const T &y) { x += y; }
    template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
    template <class T> static void mul(T &x, const T &y) { x *= y; }
    template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
    template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y,true : false; }
    template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y,true : false; }
};
using updater::chmax;
using updater::chmin;

template <class T> T minf(const T &x, const T &y) { return min(x,y); }
template <class T> T mixf(const T &x, const T &y) { return max(x,y); }
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> i64 binry(i64 ok, i64 ng, const F &fn) {
    while (abs(ok - ng) > 1) {
        i64 mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class A> void cmprs(A ary[], size_t n) {
    vector<A> tmp(ary,ary + n);
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(A *i = ary; i != ary + n; ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class T> void cmprs(vector<T> &v) {
    vector<T> tmp = v; sort(begin(tmp),end(tmp));
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(auto i = begin(v); i != end(v); ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class F> void for_subset(uint_fast64_t s, const F &fn) {
    uint_fast64_t tmp = s;
    do { fn(tmp); } while((--tmp &= s) != s);
}


struct aaa {
    i64 x,y,z;
  	aaa () : x(),y(),z() {}
  	aaa (int p,int q,int r) : x(p),y(q),z(r) {}
};

auto op=[](aaa p,aaa q) -> aaa {
    aaa ret;
    ret.x=(p.x+q.x)%mod;
    ret.y=(p.y+q.y)%mod;
    ret.z=(p.z+q.z)%mod;
    return ret;
};
    auto updat=[](aaa &x,aaa y,size_t nn) -> void {
    x.x=(x.x*y.x%mod+x.y*y.y%mod+x.z*y.z%mod)%mod;
};
    auto laz=[](aaa &y,aaa x) -> void {
    aaa tmp;
    tmp.x=x.x*y.x%mod;
    tmp.y=(x.x*y.y+x.y)%mod;
    tmp.z=(x.x*y.z+x.z)%mod;
    y=tmp;
};

template <class Monoid, class T = Monoid, size_t N = 1 << 20>
struct LazySegtree {
    using opr_t = function<Monoid(const Monoid&, const Monoid&)>;
    using lazy_opr_t = function<void(T&, const T&)>;
    using update_opr_t = function<void(Monoid&, const T&, size_t)>;
    const opr_t opr;
    const lazy_opr_t lazy_opr;
    const update_opr_t update_opr;
    const Monoid idel,lazy_idel;
    Monoid data[N << 1],lazy[N << 1];
    bool lazyflag[N << 1];
    const size_t n;

    LazySegtree(size_t n_, Monoid idel_, const opr_t &opr_, const lazy_opr_t &lazy_opr_, const update_opr_t &update_opr_, Monoid lazy_idel_) : n(n_),opr(opr_),lazy_opr(lazy_opr_),update_opr(update_opr_),idel(idel_),lazy_idel(lazy_idel_)
    {
        fill(begin(data),end(data),idel);
        fill(begin(lazy),end(lazy),lazy_idel);
    }

    template <class P> void copy(P s, P t) {
        for(size_t i = N; s != t; ++s, ++i) data[i] = *s;
        for(size_t i = N - 1; i; --i) data[i] = opr(data[i * 2],data[i * 2 + 1]);
    }

    template <class A> void copy(A &v) {
        copy(begin(v),end(v));
    }

    void eval(size_t k, size_t l, size_t r) {
        if(!lazyflag[k]) return;
        update_opr(data[k],lazy[k],r - l);
        if(r - l > 1) {
            lazy_opr(lazy[k * 2],lazy[k]);
            lazy_opr(lazy[k * 2 + 1],lazy[k]);
            lazyflag[k * 2] = lazyflag[k * 2 + 1] = true;
        }
        lazy[k] = lazy_idel;
        lazyflag[k] = false;
    }

    void update(size_t a, size_t b, T val, size_t k = 1, size_t l = 0, size_t r = N) {
        eval(k,l,r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b) {
            lazy_opr(lazy[k],val);
            lazyflag[k] = true;
            eval(k,l,r);
        } else {
            update(a,b,val,k * 2,l,l + r >> 1);
            update(a,b,val,k * 2 + 1,l + r >> 1,r);
            data[k] = opr(data[k * 2],data[k * 2 + 1]);
        }
    }

    Monoid query(size_t a, size_t b, size_t k = 1, size_t l = 0, size_t r = N) {
        if(b <= l || r <= a) return idel;
        eval(k,l,r);
        if(a <= l && r <= b) return data[k];
        return opr(query(a,b,k * 2,l,l + r >> 1),query(a,b,k * 2 + 1,l + r >> 1,r));
    }
};

i64 fib[1<<20];
int n,qry;


signed main() {
    cin>>n>>qry;
    fib[0]=0; fib[1]=1;
    rep(i,n) fib[i+2]=(fib[i]+fib[i+1])%mod;
  	aaa zer(0,0,0);
  	aaa one(1,0,0);
    LazySegtree<aaa> sg(n,zer,op,laz,updat,one);
    vector<aaa> initial(n);
    for(int i=0; i<n; ++i) {
        initial[i].x=0;
        initial[i].y=fib[i];
        initial[i].z=1;
    }
    sg.copy(initial);
    while(qry--) {
        int q,l,r,k; cin>>q>>l>>r>>k;
        if(q) {
            aaa tmp;
            switch (q)
            {
                case 1:
                    tmp={0,0,k};
                    break;
                case 2:
                    tmp={1,0,k};
                    break;
                case 3:
                    tmp={k,0,0};
                    break;
                case 4:
                    tmp={1,k,0};
                    break;
                default:
                    break;
            }
            sg.update(l,r+1,tmp);
        } else {
            cout<<sg.query(l,r+1).x*k%mod<<endl;
        }
    }
}