結果

問題 No.1441 MErGe
コンテスト
ユーザー heno239
提出日時 2021-03-26 21:42:30
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 470 ms / 1,000 ms
コード長 5,255 bytes
コンパイル時間 13,464 ms
コンパイル使用メモリ 188,408 KB
最終ジャッジ日時 2025-01-19 22:07:21
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#pragma GCC target("avx2")
#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>
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) {
	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;
	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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
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];
}

struct SegT {
private:
	int sz; vector<LP> node;
public:
	SegT(vector<int> v) {
		int n = v.size();
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, { 0,0 });
		rep(i, n)node[i + sz - 1] = { v[i],1 };
		per(i, sz - 1) {
			node[i] = f(node[2 * i + 1], node[2 * i + 2]);
		}
	}
	LP f(LP a, LP b) {
		return { a.first + b.first,a.second + b.second };
	}
	void update(int k, ll a) {
		k += sz - 1;
		node[k] = { a,1 };
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	void to0(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (node[k].second == 0)return;
		if (r <= a || b <= l)return;
		else if (a <= l && r <= b) {
			node[k] = { 0,0 };
			if (l + 1 < r) {
				to0(a, b, 2 * k + 1, l, (l + r) / 2);
				to0(a, b, 2 * k + 2, (l + r) / 2, r);
			}
		}
		else {
			to0(a, b, 2 * k + 1, l, (l + r) / 2);
			to0(a, b, 2 * k + 2, (l + r) / 2, r);
			node[k] = f(node[2 * k + 1], node[2 * k + 2]);
		}
	}
	int find_loc(int id) {
		if (id >= node[0].second)return sz;
		int k = 0;
		while (k < sz - 1) {
			if (node[2 * k + 1].second > id) {
				k = 2 * k + 1;
			}
			else {
				id -= node[2 * k + 1].second;
				k = 2 * k + 2;
			}
		}
		return k - (sz - 1);
	}
	ll query(int r) {
		ll res = 0;
		int k = 0;
		while (k < sz - 1) {
			if (node[2 * k + 1].second <= r) {
				res += node[2 * k + 1].first;
				r -= node[2 * k + 1].second;
				k = 2 * k + 2;
			}
			else {
				k = 2 * k + 1;
			}
		}
		if (r > 0)res += node[k].first;
		return res;
	}
	ll query(int l, int r) {
		return query(r) - query(l);
	}
	
};
void solve() {
	int n, q; cin >> n >> q;
	vector<int> a(n); rep(i, n)cin >> a[i];
	SegT st(a);
	rep(i, q) {
		int t, l, r; cin >> t >> l >> r; l--; r--; r++;
		ll sum = st.query(l, r);
		if (t == 1) {
			int locl = st.find_loc(l);
			int locr = st.find_loc(r);
			//cout << "? " << locl << " " << locr << "\n";
			st.to0(locl, locr);
			st.update(locl, sum);
		}
		else {
			int locl = st.find_loc(l);
			int locr = st.find_loc(r);
			//cout << "? " << locl << " " << locr << "\n";
			cout << sum << "\n";
		}
	}
}

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