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

提出ソース

結果

問題	No.749 クエリ全部盛り
ユーザー	heno239
提出日時	2020-08-30 12:19:35
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	669 ms / 3,000 ms
コード長	6,324 bytes
コンパイル時間	1,574 ms
コンパイル使用メモリ	129,144 KB
実行使用メモリ	140,932 KB
最終ジャッジ日時	2023-08-09 11:04:52
合計ジャッジ時間	7,669 ms
ジャッジサーバーID （参考情報）	judge15 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 11,568 KB
testcase_01	AC	5 ms 11,616 KB
testcase_02	AC	5 ms 11,576 KB
testcase_03	AC	5 ms 11,556 KB
testcase_04	AC	4 ms 11,580 KB
testcase_05	AC	7 ms 11,780 KB
testcase_06	AC	7 ms 11,692 KB
testcase_07	AC	7 ms 11,708 KB
testcase_08	AC	7 ms 11,692 KB
testcase_09	AC	7 ms 11,700 KB
testcase_10	AC	35 ms 13,144 KB
testcase_11	AC	35 ms 13,136 KB
testcase_12	AC	35 ms 13,080 KB
testcase_13	AC	34 ms 13,148 KB
testcase_14	AC	35 ms 13,132 KB
testcase_15	AC	651 ms 140,916 KB
testcase_16	AC	666 ms 140,820 KB
testcase_17	AC	669 ms 140,932 KB
testcase_18	AC	668 ms 140,876 KB
testcase_19	AC	655 ms 140,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}


#define ftt function<T(T,T)>
#define ftu function<T(T,U,int,int)>
#define fuu function<U(U,U)>

template<typename T, typename U>
struct SegT {
private:
	int n;
	vector<T> node;
	vector<U> lazy;
	T et; U eu;
	ftt f;
	ftu g;
	fuu h;
public:
	SegT(vector<T> ori, T _et, U _eu, ftt _f, ftu _g, fuu _h) {
		int sz = ori.size();
		et = _et, eu = _eu; f = _f, g = _g, h = _h;
		n = 1;
		while (n < sz)n <<= 1;
		node.resize(2 * n - 1, et);
		lazy.resize(2 * n - 1, eu);
		rep(i, sz) {
			node[i + n - 1] = ori[i];
		}
		per(i, n - 1) {
			node[i] = f(node[2 * i + 1], node[2 * i + 2]);
		}
	}
	SegT(int sz, T _et, U _eu, ftt _f, ftu _g, fuu _h) {
		et = _et, eu = _eu; f = _f, g = _g, h = _h;
		n = 1;
		while (n < sz)n <<= 1;
		node.resize(2 * n - 1, et);
		lazy.resize(2 * n - 1, eu);
	}
	void eval(int k, int l, int r) {
		node[k] = g(node[k], lazy[k], l, r);
		if (r - l > 1) {
			lazy[2 * k + 1] = h(lazy[k], lazy[2 * k + 1]);
			lazy[2 * k + 2] = h(lazy[k], lazy[2 * k + 2]);
		}
		lazy[k] = eu;
	}
	void add(U x, int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return;
		if (a <= l && r <= b) {
			lazy[k] = h(x, lazy[k]);
			eval(k, l, r);
		}
		else {
			add(x, a, b, k * 2 + 1, l, (l + r) / 2);
			add(x, a, b, k * 2 + 2, (l + r) / 2, r);
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	T query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return et;
		if (a <= l && r <= b)return node[k];
		else {
			T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
	void update(int loc, T x) {
		int k = 0, l = 0, r = n;
		stack<P> st;
		while (k < n - 1) {
			eval(k, l, r);
			st.push({ l,r });
			if (loc < (l + r) / 2) {
				k = 2 * k + 1;
				r = (l + r) / 2;
			}
			else {
				k = 2 * k + 2;
				l = (l + r) / 2;
			}
		}
		eval(k, l, r);
		st.push({ l,r });
		node[k] = x;
		while (k > 0) {
			k = (k - 1) / 2;
			st.pop();
			l = st.top().first, r = st.top().second;
			eval(2 * k + 1, l, (l + r) / 2);
			eval(2 * k + 2, (l + r) / 2, r);
			node[k] = f(node[2 * k + 1], node[2 * k + 2]);
		}
	}
};

struct nd {
	modint val, fs;
};
struct ste {
	ll upd; modint val, ad, coef;
};
void solve() {
	int n, q; cin >> n >> q;
	vector<nd> ori(n);
	ori[0] = { 0,0 }; if (n >= 2)ori[1] = { 0,1 };
	for (int i = 2; i < n; i++) {
		ori[i] = { 0,ori[i - 1].fs + ori[i - 2].fs };
	}
	auto f = [](nd a, nd b)->nd {
		return { a.val + b.val,a.fs + b.fs };
	};
	auto g = [](nd a, ste b, int l, int r)->nd {
		if (b.upd >= 0) {
			a.val = b.upd*(r-l);
		}
		a.val = a.val * b.val + b.ad*(modint)(r-l) + a.fs * b.coef;
		return a;
	};
	auto h = [](ste a, ste b)->ste {
		if (a.upd >= 0) {
			return a;
		}
		else {
			b.val *= a.val;
			b.ad *= a.val;
			b.coef *= a.val;
			b.ad += a.ad;
			b.coef += a.coef;
		}
		return b;
	};
	nd e = { 0,0 };
	ste este = { -1,1,0,0 };
	SegT<nd, ste> st(ori, e, este, f, g, h);

	rep(i, q) {
		int t; cin >> t;
		int l, r, k; cin >> l >> r >> k;
		if (t == 0) {
			nd d = st.query(l, r + 1);
			modint ans = d.val * (modint)k;
			cout << ans << "\n";
		}
		else if (t == 1) {
			ste s = { k,1,0,0 };
			st.add(s, l, r + 1);
		}
		else if (t == 2) {
			ste s = { -1,1,k,0 };
			st.add(s, l, r + 1);
		}
		else if (t == 3) {
			ste s = {-1,k,0,0 };
			st.add(s, l, r + 1);
		}
		else {
			ste s = { -1,1,0,k };
			st.add(s, l, r + 1);
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f(); 
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード