Submission #70259621

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#include <algorithm>
#include <cassert>
#include <vector>
const int INF = 1e9;
const long long LINF = 1e18;
template<class S, S op(S l, S r), S e()>
struct DualSegtree {
private:
	int mn = 0;
	int mN = 0;
	int mlogN = 0;
	std::vector<S> A;
	void propagate(int i) {
		if (i >= mN) return;
		A[i * 2] = op(A[i * 2], A[i]);
		A[i * 2 + 1] = op(A[i * 2 + 1], A[i]);
		A[i] = e();
	}
	void full_propagate(int i) {
		for (int d = mlogN; d > 0; d--) propagate(i >> d);
	}
public:
	DualSegtree(int n = 0) {
		mn = n;
		mlogN = 0; mN = 1;
		while (mN < n) { mN *= 2; mlogN++; }
		A.assign(mN * 2, e());
	}
	void point_init(int p) {
		assert(0 <= p); assert(p < mn);
		p += mN;
		full_propagate(p);
		A[p] = e();
	}
	S get(int p) {
		assert(0 <= p); assert(p < mn);
		p += mN;
		full_propagate(p);
		return A[p];
	}
	void apply(int l, int r, S x) {
		l += mN;
		r += mN;
		if (l != mN) full_propagate(l - 1);
		if (r != mN * 2) full_propagate(r);
		while (l < r) {
			if (l & 1) { A[l] = op(A[l], x); l++; }
			if (r & 1) { r--; A[r] = op(A[r], x); }
			l /= 2; r /= 2;
		}
	}
};
namespace RangeUpdate {
	//区間更新、一点取得
	using S = pair<int, int>;
	S e() { return { -1,-1 }; }
	S op(S x, S f) { return (f == e() ? x : f); }
}
using namespace RangeUpdate;
template <class T, class F>
T binarySearch(T ok, T ng, const F &f) {
	while (abs(ok - ng) > 1) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>w(n);
	rep(i, n)cin >> w[i];

	DualSegtree<S, op, e>segL(n);
	DualSegtree<S, op, e>segR(n);
	rep(i, n) {
		segL.apply(i, i + 1, { 0,-1 });
		segR.apply(i, i + 1, { w[i],-1 });
	}

	int q; cin >> q;
	int eve = -1;
	auto getpoint = [&](int index)->P {
		auto pL = segL.get(index);
		auto pR = segR.get(index);
		int l, r;
		if (pL.second >= pR.second) {
			l = pL.first;
			r = l + w[index];
		}
		else {
			r = pR.first;
			l = r - w[index];
		}
		return { l,r };
	};
	while (q--) {
		eve++;
		int t; cin >> t;
		if (t == 1 || t == 2) {
			int u; cin >> u, u--;
			auto[l, r] = getpoint(u);
			if (t == 1)segL.apply(0, u, { l,eve });
			else segR.apply(0, u, { r,eve });
			/*rep(i, n) {
				auto[l, r] = getpoint(i);
				cout << l << "_" << r << endl;
			}*/
		}
		else {
			int x; cin >> x;
			auto f = [&](const long long index)->bool {
				auto[l, r] = getpoint(index);
				return l <= x && x < r;
			};
			auto r = binarySearch<int>(n, -1, f);
			int ans = n - r;
			cout << ans << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result