結果

問題 No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに
ユーザー FF256grhyFF256grhy
提出日時 2022-10-15 00:36:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,282 ms / 6,000 ms
コード長 7,713 bytes
コンパイル時間 3,552 ms
コンパイル使用メモリ 233,088 KB
実行使用メモリ 66,924 KB
最終ジャッジ日時 2024-06-26 18:35:09
合計ジャッジ時間 45,335 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 681 ms
47,836 KB
testcase_04 AC 867 ms
55,044 KB
testcase_05 AC 560 ms
38,176 KB
testcase_06 AC 799 ms
49,832 KB
testcase_07 AC 998 ms
57,956 KB
testcase_08 AC 832 ms
51,464 KB
testcase_09 AC 505 ms
34,856 KB
testcase_10 AC 426 ms
30,940 KB
testcase_11 AC 604 ms
36,484 KB
testcase_12 AC 596 ms
36,428 KB
testcase_13 AC 449 ms
31,100 KB
testcase_14 AC 274 ms
15,564 KB
testcase_15 AC 1,059 ms
60,896 KB
testcase_16 AC 977 ms
60,660 KB
testcase_17 AC 234 ms
15,984 KB
testcase_18 AC 1,260 ms
66,800 KB
testcase_19 AC 1,253 ms
66,672 KB
testcase_20 AC 1,263 ms
66,796 KB
testcase_21 AC 1,253 ms
66,672 KB
testcase_22 AC 1,242 ms
66,804 KB
testcase_23 AC 1,259 ms
66,796 KB
testcase_24 AC 1,243 ms
66,676 KB
testcase_25 AC 1,273 ms
66,800 KB
testcase_26 AC 1,244 ms
66,672 KB
testcase_27 AC 1,278 ms
66,924 KB
testcase_28 AC 1,266 ms
66,672 KB
testcase_29 AC 1,250 ms
66,672 KB
testcase_30 AC 1,279 ms
66,796 KB
testcase_31 AC 1,272 ms
66,796 KB
testcase_32 AC 1,282 ms
66,668 KB
testcase_33 AC 1,152 ms
66,796 KB
testcase_34 AC 1,159 ms
66,796 KB
testcase_35 AC 1,157 ms
66,804 KB
testcase_36 AC 1,163 ms
66,696 KB
testcase_37 AC 1,143 ms
66,796 KB
testcase_38 AC 160 ms
11,732 KB
testcase_39 AC 308 ms
19,668 KB
testcase_40 AC 490 ms
26,188 KB
testcase_41 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN  = [](auto const & ... a) { outF(""  , ""  , a ...); };
auto outS  = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL  = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , ""  , a ...); };
auto outNL = [](auto const & ... a) { outF(""  , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
template<typename A> istream & operator>>(istream & is, vector<A>       & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
template<typename A, size_t N> istream & operator>>(istream & is, array<A, N>       & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>       & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename ... A> istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }

// ---- ----

template<typename T> class SegmentTree {
private:
	int n, s;
	vector<T> a;
	function<T(T &, T &)> f;
	T e;
	bool ok;
	void shift(int & p) {
		assert(inIX(p, 0, n));
		p += s;
	}
public:
	SegmentTree() { n = 0; }
	SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }
	void init(int nn, function<T(T &, T &)> ff, T ee) {
		n = nn;
		f = ff;
		e = ee;
		s = 1;
		while(s < n) { s *= 2; }
		a = vector<T>(2 * s, e);
		ok = true;
	}
	void apply(int p, function<void(T &)> g) {
		shift(p);
		g(a[p]);
		while(p > 1) {
			p /= 2;
			a[p] = f(a[2 * p], a[2 * p + 1]);
		}
	}
	T fold_IX(int l, int r) {
		assert(ok);
		assert(inII(l, 0, n)); l += s;
		assert(inII(r, 0, n)); r += s; r--;
		T x = e, y = e;
		while(l <= r) {
			if(l % 2 == 1) { x = f(x, a[l]); l++; }
			if(r % 2 == 0) { y = f(a[r], y); r--; }
			l /= 2;
			r /= 2;
		}
		return f(x, y);
	}
	T fold_II(int l, int r) { return fold_IX(l + 0, r + 1); }
	T fold_XI(int l, int r) { return fold_IX(l + 1, r + 1); }
	T fold_XX(int l, int r) { return fold_IX(l + 1, r + 0); }
	const T & operator[](int p) {
		shift(p);
		return a[p];
	}
	T & ref(int p) {
		shift(p);
		ok = false;
		return a[p];
	}
	void calc() {
		dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }
		ok = true;
	}
};
#define OP(s) [&](auto & A, auto & B) { return s; }
#define AP(s) [&](auto & A) { s; }

// ----

int main() {
	int IN(n);
	vector<LL> a(n), t(n);
	inc(i, n) { in(a[i], t[i]); t[i]--; }
	
	map<LL, vector<pair<int, int>>> mp;
	inc(i, n) {
		mp[t[i]       ].EB(0, i);
		mp[t[i] + a[i]].EB(1, i);
	}
	mp[1e10].EB(-1, -1);
	
	SegmentTree<LL> st_s(n, OP(A + B), 0), st_c = st_s;
	inc(i, n) { st_s.ref(i) = a[i]; }
	st_s.calc();
	
	int IN(q);
	vector<array<LL, 4>> Q;
	inc(id, q) {
		int IN(d, l, r);
		l--; r--;
		Q.PB({ d, l, r, id });
	}
	ST(Q);
	
	vector<LL> ans(q);
	
	auto it = mp.begin();
	SF(Q, d, l, r, id) {
		while(it -> FI < d) {
			SF(it -> SE, f, i) {
				if(f == 0) {
					st_s.apply(i, AP(A = a[i] + t[i]));
					st_c.apply(i, AP(A = 1));
				} else {
					st_s.apply(i, AP(A = 0));
					st_c.apply(i, AP(A = 0));
				}
			}
			++it;
		}
		ans[id] = st_s.fold_II(l, r) - st_c.fold_II(l, r) * d;
	}
	dispL(ans);
}
0