제출 #527052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527052		Lobo	가로등 (APIO19_street_lamps)	C++17	60 / 100	296 ms	32328 KiB

street_lamps

#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 330000

int n, q;
int s1[110][110];
int s2[maxn], ans2[maxn], cur2[maxn];
int tr[maxn];
pair<string,pair<int,int>> qr[maxn];

void att(int no, int l, int r, int pos, int val) {
    if(l > pos || r < pos) return;
    else if(l == r) {
        tr[no] = val;
    }
    else {
        int f1 = 2*no;
        int f2 = 2*no+1;
        int mid = (l+r)/2;

        att(f1,l,mid,pos,val);
        att(f2,mid+1,r,pos,val);
        tr[no] = max(tr[f1],tr[f2]);
    }
}

int qrr(int no, int l, int r, int L, int R) {
    if(l > R || r < L) return 0;
    else if(l >= L && r <= R) {
        return tr[no];
    }
    else {
        int f1 = 2*no;
        int f2 = 2*no+1;
        int mid = (l+r)/2;

        return max(qrr(f1,l,mid,L,R),qrr(f2,mid+1,r,L,R));
    }
}

void solve() {
    string est;
    cin >> n >> q >> est;

    bool oksub2 = true;
    for(int i = 1; i <= q; i++) {
        string sss; cin >> sss;
        if(sss == "toggle") {
            int pos; cin >> pos;
            qr[i] = mp(sss,mp(pos,0));
        }
        else {
            int l, r;
            cin >> l >> r;
            qr[i] = mp(sss,mp(l,r));
            if(r != l+1) oksub2 = false;
        }

    }

    if(n <= 100 && q <= 100) {
        for(int i = 1; i <= n; i++) {
            s1[i][0] = est[i-1]-'0';
        }

        for(int i = 1; i <= q; i++) {
            for(int j = 1; j <= n; j++) {
                s1[j][i] = s1[j][i-1];
            }

            string sss; sss = qr[i].fr;
            if(sss == "toggle") {
                int pos; pos = qr[i].sc.fr;
                s1[pos][i]^= 1;
                continue;
            }

            int l,r; 
            l = qr[i].sc.fr;
            r = qr[i].sc.sc;
            r--;
            int ans = 0;
            for(int j = 0; j < i; j++) {
                int ok = 1;
                for(int k = l; k <= r; k++) {
                    if(s1[k][j] == 0) ok = 0;
                }
                ans+= ok;
            }

            cout << ans << endl;
        }
    }
    else if(oksub2) {
        for(int i = 1; i <= n; i++) {
            s2[i] = est[i-1]-'0';
            cur2[i] = 0;
            ans2[i] = 0;
        }

        for(int i = 1; i <= q; i++) {
            string sss; sss = qr[i].fr;
            int pos; pos = qr[i].sc.fr;
            ans2[pos]+= (i-cur2[pos])*s2[pos];
            cur2[pos] = i;

            if(sss == "toggle") {
                ans2[pos]+= (i-cur2[pos])*s2[pos];
                cur2[pos] = i;
                s2[pos]^= 1;
                continue;
            }

            pos = qr[i].sc.sc; pos--;

            cout << ans2[pos] << endl;
        }
    }
    else {
        for(int i = 1; i <= n; i++) {
            if(est[i-1]-'0' == 1) {
                att(1,1,n,i,0);
            }
            else {
                att(1,1,n,i,inf);
            }
        }

        for(int i = 1; i <= q; i++) {
            string sss; sss = qr[i].fr;

            if(sss == "toggle") {
                int pos; pos = qr[i].sc.fr;
                att(1,1,n,pos,i);
                continue;
            }

            int l, r;
            l = qr[i].sc.fr;
            r = qr[i].sc.sc; r--;

            cout << max(0LL,i-qrr(1,1,n,l,r)) << endl;
        }
    }


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

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