#714666 (C++14) No.1441 MErGe

• 問題: No.1441 MErGe
• ユーザー: XD
• 提出日時: 2021-11-12 11:39:42
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,105 bytes
• コンパイル時間: 1,511 ms
• コンパイル使用メモリ: 168,524 KB
• 実行使用メモリ: 17,852 KB
• 最終ジャッジ日時: 2024-11-24 20:57:56
• 合計ジャッジ時間: 5,468 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 9,552 KB
testcase_01	AC	2 ms; 9,544 KB
testcase_02	AC	3 ms; 9,544 KB
testcase_03	AC	2 ms; 9,676 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	35 ms; 14,152 KB
testcase_29	AC	36 ms; 15,472 KB

ソースコード

#include <bits/stdc++.h>
#define forn(i,s,t) for(register int i=(s); i<=(t); ++i)
#define forl(i,s,t) for(register i64 i=(s); i<=(t); ++i)
#define form(i,s,t) for(register int i=(s); i>=(t); --i)
#define rep(i,s,t) for(register int i=(s); i<(t); ++i)
#define IT(u) for(register int i=G[u]; i; i=E[i].nxt)
using namespace std;
namespace FASTIO {
	const int SIZ = 1 << 26 | 1;
	char ibuf[SIZ], obuf[SIZ], *iS = ibuf, *iT = ibuf, *oS = obuf, *oT = obuf + SIZ - 1, qwq[60], qaq;
	#define gc() (iS == iT && (iT = (iS = ibuf) + fread(ibuf, 1, SIZ, stdin), iS == iT) ? EOF : *iS++)
	template<typename T>
	inline void Rdn(T& A) {
		register bool fl = 0;
		register char ch = gc(); A = 0;
		while(!isdigit(ch)) fl = (ch == '-'), ch = gc();
		while(isdigit(ch)) A = (A * 10) + (ch & 15), ch = gc();
		fl && (A = -A);
	}
	inline void Rdn(char& c) {while((c = gc()) == ' ' || c == '\n' || c == '\r');}
	inline void Rdn(char* s) {
		while((*s = gc()) == ' ' || *s == '\n' || *s == '\r') ;
		if(*s == EOF) return ;
		while(*s != ' ' && *s != '\n' && *s != '\r' && *s != EOF) *(++s) = gc();
		*s = 0;
	}
	template<typename T, typename ...U>
	inline void Rdn(T& A, U& ...B) {Rdn(A), Rdn(B...);}
	inline void flush() {fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;}
	inline void pc(char c) {*oS ++ = c; if(oS == oT) flush();}
	template<typename T>
	inline void Wtn(T A) {
		if(!A) return pc('0'); if(A < 0) pc('-'), A = -A;
		while(A) qwq[++qaq] = A % 10 + '0', A /= 10;
		while(qaq) pc(qwq[qaq -- ]);
	}
	inline void Wtn(char A) {pc(A);}
	inline void Wtn(char *s) {while(*s) pc(*s), ++s;}
	inline void Wtn(const char *s) {while(*s) pc(*s), ++s;}
	template<typename T, typename ...U>
	inline void Wtn(T A, U ...B) {Wtn(A), Wtn(B...);}
#undef gc
}
using FASTIO :: Rdn;
using FASTIO :: Wtn;
using FASTIO :: flush;
typedef long long i64;
typedef double f64;
typedef unsigned long long u64;
typedef pair<i64, i64> pii;
typedef pair<int, u64> piu;
const int N = 2e5 + 5;
const i64 INF = 1e18;
inline void init() {}
int n, m, nxt[N], pre[N]; i64 a[N];
struct BIT {
	int val[N], R, A;
	inline void upd(int p, int k) {while (p <= R) val[p] += k, p += p & -p; }
	inline int Qry(int p) {A = 0; while (p) A += val[p], p -= p & -p; return A; }
	inline int qry(int p) {
		int res = 0;
		form (i, 19, 0) if (res + (1 << i) <= R && p >= val[res | 1 << i]) res ^= 1 << i, p -= val[res];
		return res;
	}
} ZT;
inline void solve() {
	Rdn(n, m); ZT.R = n;
	forn (i, 1, n) Rdn(a[i]), a[i] += a[i - 1], ZT.upd(i, 1), nxt[i] = i + 1, pre[i] = i - 1;
	forn (i, 1, m) {
		int opt, l, r, lim; Rdn(opt, l, r); lim = r - l;
		if (opt == 1) {
			int nowp = ZT.qry(l + 1); 
			while (lim -- ) /*Wtn(nowp, '\n'), */ZT.upd(nowp, -1), nxt[pre[nowp]] = nxt[nowp], nowp = nxt[nowp];
		} else {
//			Wtn(ZT.qry(l), ' ', ZT.qry(r + 1), '\n');
			Wtn(a[ZT.qry(r)] - (l == 1 ? 0 : a[ZT.qry(l - 1)]), '\n');
		}
//		forn (i, 0, 17) Wtn(ZT.val[1 << i], " \n"[i == 17]);
//		forn (j, 1, n) Wtn(ZT.Qry(j), " \n"[j == n]); 
//		forn (j, 1, n) Wtn(ZT.qry(j), " \n"[j == n]);
	}
}
int Trd;
int main() {
	Trd = 1;
	while(Trd--) init(), solve(); flush();
	return 0;
}