Submission #1130976

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130976		Nonoze	Street Lamps (APIO19_street_lamps)	C++20	20 / 100	126 ms	12268 KiB

street_lamps

/*
*	Author: Nonoze
*	Created: Tuesday 31/12/2024
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef IN_LOCAL
	#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;
}



struct segtree {
	int n;
	vector<int> t;
	segtree(int _n) {
		n=_n;
		t.resize(2*n, 0);
	}
	void build(vector<int>&a) {
		for (int i=0; i<n; i++) t[i+n]=a[i];
		for (int i=n-1; i>0; i--) t[i]=max(t[i<<1], t[i<<1|1]);
	}
	void update(int pos, int val) {
		for (t[pos+=n]=val; pos>1; pos>>=1) t[pos>>1]=max(t[pos], t[pos^1]);
	}
	int query(int l, int r) {
		r++;
		int res=-1;
		for (l+=n, r+=n; l<r; l>>=1, r>>=1) {
			if (l&1) cmax(res, t[l++]);
			if (r&1) cmax(res, t[--r]);
		}
		return res;
	}
};

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<int> vec;
	for (auto u: a) vec.pb(u?-1:inf);
	segtree st(n-1); st.build(vec);
	for (int j=0; j<q; j++) {
		cin >> s;
		if (s=="toggle") {
			int i; cin >> i; i--;
			st.update(i, j);
		} else {
			int x, y; cin >> x >> y; x--, y--;
			int ans=st.query(x, y-1);
			if (ans==inf) cout << 0 << endl;
			else cout << j-ans << endl;
		}
	}
}

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