#860810 (C++17) No.880 Yet Another Segment Tree Problem

提出ソース

結果

問題	No.880 Yet Another Segment Tree Problem
ユーザー	heno239
提出日時	2023-04-19 20:08:23
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	397 ms / 5,000 ms
コード長	8,012 bytes
コンパイル時間	2,309 ms
コンパイル使用メモリ	152,496 KB
実行使用メモリ	17,176 KB
最終ジャッジ日時	2023-10-24 03:05:01
合計ジャッジ時間	11,663 ms
ジャッジサーバーID （参考情報）	judge12 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	9 ms 17,020 KB
testcase_01	AC	10 ms 17,032 KB
testcase_02	AC	11 ms 17,032 KB
testcase_03	AC	10 ms 17,032 KB
testcase_04	AC	11 ms 17,032 KB
testcase_05	AC	10 ms 17,032 KB
testcase_06	AC	10 ms 17,032 KB
testcase_07	AC	11 ms 17,032 KB
testcase_08	AC	11 ms 17,032 KB
testcase_09	AC	11 ms 17,032 KB
testcase_10	AC	11 ms 17,032 KB
testcase_11	AC	361 ms 17,028 KB
testcase_12	AC	355 ms 17,028 KB
testcase_13	AC	264 ms 17,028 KB
testcase_14	AC	362 ms 17,120 KB
testcase_15	AC	380 ms 17,120 KB
testcase_16	AC	397 ms 17,120 KB
testcase_17	AC	319 ms 17,120 KB
testcase_18	AC	313 ms 17,120 KB
testcase_19	AC	226 ms 17,120 KB
testcase_20	AC	233 ms 17,120 KB
testcase_21	AC	233 ms 17,176 KB
testcase_22	AC	226 ms 17,120 KB
testcase_23	AC	229 ms 17,116 KB
testcase_24	AC	216 ms 17,120 KB
testcase_25	AC	227 ms 17,120 KB
testcase_26	AC	222 ms 17,176 KB
testcase_27	AC	222 ms 17,120 KB
testcase_28	AC	223 ms 17,116 KB
testcase_29	AC	354 ms 17,120 KB
testcase_30	AC	374 ms 17,120 KB
testcase_31	AC	395 ms 17,120 KB
testcase_32	AC	121 ms 17,120 KB
testcase_33	AC	206 ms 17,120 KB
testcase_34	AC	253 ms 17,120 KB
testcase_35	AC	228 ms 17,120 KB
testcase_36	AC	199 ms 17,120 KB
testcase_37	AC	196 ms 17,120 KB

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

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

const int sz = (1 << 17);
struct Data {
	ll sum; int ma; int l;
};
Data f(Data a, Data b) {
	Data res;
	res.sum = a.sum + b.sum;
	res.ma = max(a.ma, b.ma);
	int g = gcd(a.l, b.l);
	ll val = (ll)(a.l / g) * b.l;
	chmin(val, (ll)mod17);
	res.l = val;
	return res;
}
int lazy[2 * sz - 1];
Data node[2 * sz - 1];
void eval(int k, int l, int r) {
	if (lazy[k] < 0)return;
	node[k].sum = (ll)(r - l) * lazy[k];
	node[k].ma = lazy[k];
	node[k].l = lazy[k];
	if (k < sz - 1) {
		lazy[2 * k + 1] = lazy[k];
		lazy[2 * k + 2] = lazy[k];
	}
	lazy[k] = -1;
}

void update(int x,int a,int b,int k=0,int l=0, int r=sz) {
	eval(k, l, r);
	if (r <= a || b <= l)return;
	if (a <= l && r <= b) {
		lazy[k] = x;
		eval(k,l,r);
	}
	else {
		update(x, a, b, 2 * k + 1, l, (l + r) / 2);
		update(x, a, b, 2 * k + 2, (l + r) / 2, r);
		node[k] = f(node[2 * k + 1], node[2 * k + 2]);
	}
}
void updgcd(int x, int a, int b, int k = 0, int l = 0, int r = sz) {
	eval(k, l, r);
	if (r <= a || b <= l)return;
	if (a <= l && r <= b) {
		if (x % node[k].l == 0) {
			return;
		}
		else {
			if ((ll)node[k].ma * (r - l) == node[k].sum) {
				int g = gcd(x,node[k].ma);
				lazy[k] = g;
				eval(k, l, r);
			}
			else {
				updgcd(x, a, b, 2 * k + 1, l, (l + r) / 2);
				updgcd(x, a, b, 2 * k + 2, (l + r) / 2, r);
				node[k] = f(node[2 * k + 1], node[2 * k + 2]);
			}
		}
	}
	else {
		updgcd(x, a, b, 2 * k + 1, l, (l + r) / 2);
		updgcd(x, a, b, 2 * k + 2, (l + r) / 2, r);
		node[k] = f(node[2 * k + 1], node[2 * k + 2]);
	}
}
Data query(int a, int b, int k = 0, int l = 0, int r = sz) {
	eval(k, l, r);
	if (r <= a || b <= l)return { 0,0,1 };
	if (a <= l && r <= b) {
		return node[k];
	}
	else {
		Data dl=query(a, b, 2 * k + 1, l, (l + r) / 2);
		Data dr=query(a, b, 2 * k + 2, (l + r) / 2, r);
		return f(dl, dr);
	}
}

void solve(){
	int n, q; cin >> n >> q;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	rep(i, 2 * sz - 1) {
		lazy[i] = -1;
		node[i] = { 0,0,1 };
	}
	rep(i, n) {
		update(a[i], i, i + 1);
	}
	rep(i, q) {
		int typ; cin >> typ;
		if (typ == 1) {
			int l, r, x; cin >> l >> r >> x; l--;
			update(x, l, r);
		}
		else if (typ == 2) {
			int l, r, x; cin >> l >> r >> x; l--;
			updgcd(x, l, r);
		}
		else if (typ == 3) {
			int l, r; cin >> l >> r; l--;
			Data d = query(l, r);
			cout << d.ma << "\n";
		}
		else {
			int l, r; cin >> l >> r; l--;
			Data d = query(l, r);
			cout << d.sum << "\n";
		}
	}
}



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

yukicoder

結果

テストケース

ソースコード