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

提出ソース
結果

問題	No.749 クエリ全部盛り
コンテスト
ユーザー	satanic
提出日時	2018-10-20 02:24:54
言語	C++14 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	803 ms / 3,000 ms
コード長	9,417 bytes
コンパイル時間	1,658 ms
コンパイル使用メモリ	143,448 KB
実行使用メモリ	102,552 KB
最終ジャッジ日時	2024-11-19 01:38:11
合計ジャッジ時間	6,930 ms
ジャッジサーバーID （参考情報）	judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
other	AC * 20
権限があれば一括ダウンロードができます
ソースコード

raw source code
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <array>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
//#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w=0; w<n; ++w){MACRO_VEC_ROW_Scan(w, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define FORLL(w, a, n) for(ll w=ll(a);w<ll(n);++w)
#define RFORLL(w, a, n) for(ll w=ll(n)-1;w>=ll(a);--w)
#define REPLL(w, n) for(ll w=0;w<ll(n);++w)
#define RREPLL(w, n) for(ll w=ll(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }
// test
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
	return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

int f[1000006];
int c[1000006];

// ------------>8---------- LazySegmentTree ---------->8------------

// ## write [ LST lst(n, SUM/MAX/MIN, ADD/UPD) ] when using this snippet.
enum QUERY_SEG_LazySegmentTree { SUM, MAX, MIN };
enum QUERY_LAZ_LazySegmentTree { ADD, UPD };
template<class SEG, class LAZ>
class LazySegmentTree {
private:
	std::vector<SEG> seg;
	std::vector<LAZ> laz;
	std::vector<bool> isUpdated;
	int ARY_SIZE;
	SEG eSeg;
	LAZ eLaz;
	std::function<SEG(SEG, SEG)> mergeSeg;
	std::function<LAZ(LAZ, LAZ)> mergeLaz;
	std::function<SEG(SEG&, LAZ, int, int)> applyLaz;

	void push(int k, int l, int r) {
		if (!isUpdated[k]) {
			applyLaz(seg[k], laz[k], l, r);
			isUpdated[k] = true;
			if (r - l > 1) {
				laz[k * 2 + 1] = mergeLaz(laz[k * 2 + 1], laz[k]);
				laz[k * 2 + 2] = mergeLaz(laz[k * 2 + 2], laz[k]);
				isUpdated[k * 2 + 1] = false;
				isUpdated[k * 2 + 2] = false;
			}
			laz[k] = eLaz;
		}
	}
public:
	LazySegmentTree(int n, SEG eSeg, LAZ eLaz, std::function<SEG(SEG, SEG)> mergeSeg, std::function<LAZ(LAZ, LAZ)> mergeLaz, std::function<SEG(SEG&, LAZ, int, int)> applyLaz) : ARY_SIZE(1), eSeg(eSeg), eLaz(eLaz), mergeSeg(mergeSeg), mergeLaz(mergeLaz), applyLaz(applyLaz) {
		ARY_SIZE = 1;
		while (ARY_SIZE < n) ARY_SIZE *= 2;
		seg.resize(ARY_SIZE * 2 - 1);
		laz.resize(ARY_SIZE * 2 - 1);
		isUpdated.resize(ARY_SIZE * 2 - 1, true);
	}
	void update(int a, int b, LAZ v, int k, int l, int r) {
		push(k, l, r);
		if (r <= a || b <= l) return;
		if (a <= l && r <= b) {
			laz[k] = mergeLaz(laz[k], v);
			isUpdated[k] = false;
			push(k, l, r);
		}
		else {
			update(a, b, v, k * 2 + 1, l, (l + r) / 2);
			update(a, b, v, k * 2 + 2, (l + r) / 2, r);
			seg[k] = mergeSeg(seg[k * 2 + 1], seg[k * 2 + 2]);
		}
	}
	// ## update [l, r) with v
	void update(int l, int r, LAZ v) {
		update(l, r, v, 0, 0, ARY_SIZE);
	}
	SEG query(int a, int b, int k, int l, int r) {
		push(k, l, r);
		if (r <= a || b <= l) return eSeg;
		if (a <= l && r <= b) return seg[k];
		SEG vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
		SEG vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
		return mergeSeg(vl, vr);
	}
	// ## return SUM/MAX/MIN in [l, r)
	SEG query(int l, int r) {
		return query(l, r, 0, 0, ARY_SIZE);
	}
};

using LST = LazySegmentTree<ll, ll>;
// ------------>8---------- LazySegmentTree ---------->8------------

ll powMod(ll n, ll p, ll mod) {
	ll res = 1;
	while (p) {
		if (p & 1) (res *= n) %= mod;
		(n *= n) %= mod;
		p >>= 1;
	}
	return res;
}
std::map<int, int> inv;
ll invMod(ll n, ll mod) {
	if (inv.count(n)) return inv[n];
	return inv[n] = powMod(n, mod - 2, mod);
}

signed main() {
	INIT;

	f[1] = 1;
	FOR(i, 2, 1000001) {
		f[i] = (f[i - 2] + f[i - 1]) % MOD;
	}
	REP(i, 1000000) {
		c[i + 1] = (f[i] + c[i]) % MOD;
	}

	VAR(int, n, Q);
	struct L {
		int upd, add, fadd, coef;
		L() : upd(-1), add(0), fadd(0), coef(1) {}
		L(int upd, int add, int fadd, int coef) : upd(upd), add(add), fadd(fadd), coef(coef) {}
	};
	std::function<int(int, int)> mergeSeg = [&](int l, int r) {
		return (l + r) % MOD;
	};
	std::function<L(L, L)> mergeLaz = [&](L l, L r) {
		if (r.upd != -1) {
			l = r;
		}
		else {
			if (l.upd != -1) {
				l.upd = l.upd * l.coef % MOD;
				l.add = (l.add * l.coef % MOD + r.add) % MOD;
				l.fadd = (l.fadd * l.coef % MOD + r.fadd) % MOD;
				l.coef = r.coef;
			}
			else {
				int inv = invMod(l.coef, MOD);
				l.add = (l.add + r.add * inv) % MOD;
				l.fadd = (l.fadd + r.fadd * inv) % MOD;
				(l.coef *= r.coef) %= MOD;
			}
		}
		return l;
	};
	std::function<int(int&, L, int, int)> applyLaz = [&](int& l, L r, int L, int R) {
		if (r.upd != -1) l = r.upd * (R - L) % MOD;
		(l += r.add * (R - L)) %= MOD;
		(l += r.fadd * (c[R] - c[L])) %= MOD;
		(l *= r.coef) %= MOD;
		if (l < 0) l += MOD;
		return l;
	};

	LazySegmentTree<int, L> lst(n, 0, L(), mergeSeg, mergeLaz, applyLaz);
	// int time, upd, add, fadd, coef;
	REP(_, Q) {
		VAR(int, q, l, r, k);
		++r;
		if (q == 0) {
			int t = lst.query(l, r);
			OUT(t * k % MOD)BR;
		}
		else if (q == 1) {
			lst.update(l, r, L{ k, 0, 0, 1 });
		}
		else if (q == 2) {
			lst.update(l, r, L{ -1, k, 0, 1 });
		}
		else if (q == 3) {
			lst.update(l, r, L{ -1, 0, 0, k });
		}
		else {
			lst.update(l, r, L{ -1, 0, k, 1 });
		}
	}

	return 0;
}//608277227
yukicoder

結果

ソースコード
