Submission #736832

#	Time	Username	Problem	Language	Result	Execution time	Memory
736832		Magikarp4000	Street Lamps (APIO19_street_lamps)	C++17	20 / 100	305 ms	12716 KiB

street_lamps

#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 3e5+1;
int n,q;
string S;
int w[MAXN], old[MAXN], cnt[MAXN];
pair<bool,PII> qrs[MAXN];
int st[MAXN*4];

void update(int s, int tl, int tr, int idx, int val) {
    if (tl == tr) st[s] = val;
    else {
        int tm = (tl+tr)/2;
        if (idx <= tm) update(s*2,tl,tm,idx,val);
        else update(s*2+1,tm+1,tr,idx,val);
        st[s] = max(st[s*2], st[s*2+1]);
    }
}

int query(int s, int tl, int tr, int l, int r) {
    if (l <= tl && r >= tr) return st[s];
    else {
        int tm = (tl+tr)/2;
        int cur = -INF;
        if (l <= tm) cur = max(cur,query(s*2,tl,tm,l,r));
        if (r > tm) cur = max(cur,query(s*2+1,tm+1,tr,l,r));
        return cur;
    }
}

signed main() {
    OPTM;
    cin >> n >> q >> S;
    FOR(i,0,n) {
        if (S[i] == '1') update(1,0,n-1,i,-1);
        else update(1,0,n-1,i,INF);
    }
    FOR(i,0,q) {
        string t; cin >> t;
        if (t == "toggle") {
            int x; cin >> x;
            x--;
            update(1,0,n-1,x,i);
        }
        else {
            int a,b; cin >> a >> b;
            a--; b--;
            int res = query(1,0,n-1,a,b-1);
            cout << max(0,i-res) << ln;
        }
    }
}

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