제출 #1326649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326649		Nonoze	가로등 (APIO19_street_lamps)	C++20	100 / 100	2262 ms	230212 KiB

street_lamps

/*
*	Author: Nonoze
*	Created: Friday 20/02/2026
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

// #define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




template<class T>
struct simplesegtree {
	vector<T> st;
	int n;
	T idElement;

	simplesegtree() {}

	simplesegtree(int nn, T idEl, vector<T> creation={}) {
		n=nn, idElement=idEl;
		st.resize(n*2, idElement);
		if (!creation.empty()) {
			for (int i=0; i<n; i++) st[i+n]=creation[i];
			build();
		}
	}

	void build() {
		for (int i=n-1; i>0; i--) st[i] = combine(st[i<<1], st[i<<1|1]);
	}
	
	void update(int p, T val) {
		for (st[p += n] = val; p > 1; p >>= 1) st[p>>1] = combine(st[p], st[p^1]);
	}

	T query(int l, int r) {
		T resl = idElement, resr = idElement;
		r++;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (l&1) resl = combine(resl, st[l++]);
			if (r&1) resr = combine(st[--r], resr);
		}
		return combine(resl, resr);
	}

	T combine(T l, T r) {
		T ans=l+r;
		return ans;
	}
};


struct segtree1D {
	int n;
	vector<int> t;
	vector<int> vals;
	segtree1D(): n(0) {}
	segtree1D(int _n, vector<int>& a) {
		n=_n;
		t.resize(4*n);
		vals=a;
	}
	segtree1D(int _n, vector<int>& a, vector<int>& b) {
		n=_n;
		t.resize(4*n);
		vals=a;
		vals.insert(vals.end(), all(b));
		make_unique(vals);
	}
	void update(int idx, int l, int r, int ql, int qr, int val) {
		if (qr<l || r<ql) return;
		if (ql<=l && r<=qr) {
			t[idx]+=val;
			return;
		}
		int mid=(l+r)/2;
		update(2*idx, l, mid, ql, qr, val);
		update(2*idx+1, mid+1, r, ql, qr, val);
	}
	int query(int idx, int l, int r, int point) {
		if (point<l || r<point) return 0;
		if (l==r) return t[idx];
		int mid=(l+r)/2;
		return t[idx]+query(2*idx, l, mid, point)+query(2*idx+1, mid+1, r, point);
	}

	void update(int ql, int qr, int val) {
		auto lb=lower_bound(all(vals), ql)-vals.begin();
		auto ub=upper_bound(all(vals), qr)-vals.begin()-1;
		update(1, 0, n-1, lb, ub, val);
	}

	int query(int point) {
		point=lower_bound(all(vals), point)-vals.begin();
		return query(1, 0, n-1, point);
	}
};

struct segtree2D {
	int n;
	vector<segtree1D> t;
	segtree2D(int _n) {
		n=_n;
		t.resize(4*n);
	}
	void build(int idx, int l, int r, vector<vector<int>>& a) {
		if (l==r) {
			if (a[l].empty()) return;
			t[idx]=segtree1D(sz(a[l]), a[l]);
			return;
		}
		int mid=(l+r)/2;
		build(2*idx, l, mid, a);
		build(2*idx+1, mid+1, r, a);
		if (t[2*idx].n+t[2*idx+1].n==0) return;
		t[idx]=segtree1D(t[2*idx].n+t[2*idx+1].n, t[2*idx].vals, t[2*idx+1].vals);
	}

	void update(int idx, int l, int r, int ql, int qr, int v1, int v2, int val) {
		if (qr<l || r<ql) return;
		if (ql<=l && r<=qr) {
			t[idx].update(v1, v2, val);
			return;
		}
		int mid=(l+r)/2;
		update(2*idx, l, mid, ql, qr, v1, v2, val);
		update(2*idx+1, mid+1, r, ql, qr, v1, v2, val);
	}

	int query(int idx, int l, int r, int point, int p2) {
		if (point<l || r<point) return 0;
		if (l==r) return t[idx].query(p2);
		int mid=(l+r)/2;
		return t[idx].query(p2)+query(2*idx, l, mid, point, p2)+query(2*idx+1, mid+1, r, point, p2);
	}

	void update(int ql, int qr, int v1, int v2, int val) {
		update(1, 0, n-1, ql, qr, v1, v2, val);
	}

	int query(int point, int p2) {
		return query(1, 0, n-1, point, p2);
	}
};


int n, k, m, q;
vector<int> a;


void solve() {
	read(n, q); n++;
	string s; cin >> s;
	for (auto u: s) a.pb(u-'0');
	vector<vector<int>> queries;
	for (int j=0; j<q; j++) {
		cin >> s;
		if (s=="toggle") {
			int i; cin >> i; i--;
			queries.pb({0, i});
		} else {
			int x, y; cin >> x >> y; x--, y--;
			queries.pb({1, x, y});
		}
	}
	vector<vector<int>> vals(n);
	for (int i=0; i<q; i++) if (queries[i][0]==1) vals[queries[i][1]].pb(queries[i][2]);
	for (int i=0; i<n; i++) make_unique(vals[i]);
	segtree2D st(n);
	st.build(1, 0, n-1, vals);
	simplesegtree<int> st2(n, 0);
	int lborn=0;
	for (int i=0; i<n-1; i++) {
		if (a[i]) {
			st2.update(i, 1);
			st.update(lborn, i, i+1, i+1, -1);
		} else lborn=i+1;
	}
	for (int i=0; i<q; i++) {
		if (queries[i][0]==0) {
			int pos=queries[i][1];
			int lborn=pos-1, rborn=pos+1;
			{
				int l=0, r=pos-1, ans=pos;
				while (l<=r) {
					int mid=(l+r)/2;
					if (st2.query(mid, pos-1) == pos-mid) ans=mid, r=mid-1;
					else l=mid+1;
				}
				lborn=ans;
			}
			{
				int l=pos+1, r=n-1, ans=pos;
				while (l<=r) {
					int mid=(l+r)/2;
					if (st2.query(pos+1, mid) == mid-pos) ans=mid, l=mid+1;
					else r=mid-1;
				}
				rborn=ans+1;
			}
			st.update(lborn, pos, pos+1, rborn, (i+2)*(a[pos]?1:-1));
			a[pos]^=1;
			st2.update(pos, a[pos]);
		} else {
			int x=queries[i][1], y=queries[i][2];
			int ans=st.query(x, y) + (st2.query(x, y-1) == y-x?1:0) * (i+2);
			cout << ans << endl;
		}
	}
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 20 / 20