結果

問題 No.1441 MErGe
ユーザー leaf_1415leaf_1415
提出日時 2021-03-26 22:05:11
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 257 ms / 1,000 ms
コード長 5,704 bytes
コンパイル時間 1,435 ms
コンパイル使用メモリ 93,060 KB
実行使用メモリ 19,812 KB
最終ジャッジ日時 2024-11-28 23:16:33
合計ジャッジ時間 7,598 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,192 KB
testcase_01 AC 3 ms
7,284 KB
testcase_02 AC 3 ms
9,316 KB
testcase_03 AC 6 ms
9,576 KB
testcase_04 AC 6 ms
7,564 KB
testcase_05 AC 7 ms
7,624 KB
testcase_06 AC 8 ms
7,576 KB
testcase_07 AC 7 ms
7,724 KB
testcase_08 AC 45 ms
10,076 KB
testcase_09 AC 47 ms
11,620 KB
testcase_10 AC 69 ms
9,840 KB
testcase_11 AC 62 ms
11,108 KB
testcase_12 AC 69 ms
10,052 KB
testcase_13 AC 214 ms
19,176 KB
testcase_14 AC 218 ms
19,168 KB
testcase_15 AC 218 ms
18,796 KB
testcase_16 AC 217 ms
19,072 KB
testcase_17 AC 218 ms
18,800 KB
testcase_18 AC 136 ms
16,620 KB
testcase_19 AC 156 ms
17,688 KB
testcase_20 AC 125 ms
15,720 KB
testcase_21 AC 115 ms
14,456 KB
testcase_22 AC 144 ms
14,004 KB
testcase_23 AC 254 ms
19,652 KB
testcase_24 AC 257 ms
19,688 KB
testcase_25 AC 248 ms
19,692 KB
testcase_26 AC 250 ms
19,688 KB
testcase_27 AC 254 ms
19,692 KB
testcase_28 AC 165 ms
19,744 KB
testcase_29 AC 164 ms
19,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}


template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

struct SegTree{
	int size;
	vector<llint> seg;
	
	SegTree(){}
	SegTree(int size){
		this->size = size;
		seg.resize(1<<(size+1));
	}
	
	llint Ident(){  //identity element
		return 0;
	}
	llint ope(llint a, llint b){ //operator
		return (a + b);
	}
	
	void init()
	{
		for(int i = 0; i < (1<<(size+1)); i++) seg[i] = Ident();
	}
	
	void update(int i, llint val)
	{
		i += (1 << size);
		seg[i] = val;
		while(i > 1){
			i /= 2;
			seg[i] = ope(seg[i*2], seg[i*2+1]);
		}
	}

	llint query(int a, int b, int k, int l, int r)
	{
		if(b < l || r < a) return Ident();
		if(a <= l && r <= b) return seg[k];
		llint lval = query(a, b, k*2, l, (l+r)/2);
		llint rval = query(a, b, k*2+1, (l+r)/2+1, r);
		return ope(lval, rval);
	}
	llint query(int a, int b)
	{
		if(a > b) return Ident();
		return query(a, b, 1, 0, (1<<size)-1);
	}
	
	ll get(ll x)
	{
		ll i = 1;
		while(i*2 < sz(seg)){
			//outl(i, x, seg[i*2]);
			if(seg[i*2] >= x) i = i*2;
			else x -= seg[i*2], i = i*2+1;
		}
		return i - (1<<size);
	}
};

ll n, Q;
ll a[200005], sum[200005];
set<ll> S;
SegTree seg(18);

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> Q;
	rep(i, 1, n) cin >> a[i];
	
	rep(i, 1, n) sum[i] = sum[i-1] + a[i];
	rep(i, 1, n+1) S.insert(i), seg.update(i, 1);
	
	ll t, l, r;
	rep(i, 1, Q){
		cin >> t >> l >> r;
		ll L = seg.get(l), R = seg.get(r+1)-1;
		//outl(L, R);
		
		if(t == 1){
			for(auto it = S.lower_bound(L+1); it != S.end();){
				if(*it > R) break;
				auto tmp = it; it++;
				seg.update(*tmp, 0);
				S.erase(tmp);
			}
		}
		if(t == 2) cout << sum[R] - sum[L-1] << "\n";
	}
	flush(cout);

	return 0;
}
0