Submission #1130725

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130725		Ludissey	가로등 (APIO19_street_lamps)	C++20	20 / 100	288 ms	30388 KiB

street_lamps

#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
using namespace std;

vector<vector<pair<int,int>>> neigh;
vector<int> w;
struct node {
    node* left;
    node* right;
    int mx;
    void update(){
        mx=max(left->mx, right->mx);
    }
};
 
struct segtree {
    int n;
    node* root=new node{nullptr,nullptr,0};
    void build(node* x, int l, int r){
        if(l==r){
            x->mx=w[l];
            return;
        }
        x->left = new node{nullptr,nullptr,0};
        x->right = new node{nullptr,nullptr,0};
        int mid=(l+r)/2;
        build(x->left,l,mid);
        build(x->right,mid+1,r);
        x->update();
    }
    segtree(int n2){
        n=n2;
        build(root,0,n-1);
    }
    void update(node* x, int l, int r, int qP, int qV){
        if(r<qP||l>qP) return;
        if(l==r){
            x->mx=qV;
            return;
        }
        int mid=(l+r)/2;
        update(x->left,l,mid,qP,qV);
        update(x->right,mid+1,r,qP,qV);
        x->update();
    }
    void update(int qP, int qV){
        update(root,0,n-1,qP,qV);
    }
    int query(node* x, int l, int r, int qL, int qR){
        if(r<qL||l>qR) return 0;
        if(qL<=l&&r<=qR){
            return x->mx;
        }
        int mid=(l+r)/2;
        return max(query(x->left,l,mid,qL,qR),query(x->right,mid+1,r,qL,qR));
    }
    int query(int qL, int qR){
        return query(root,0,n-1,qL,qR);
    }
};

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n,q; cin >> n >> q;
    neigh.resize(n);
    w.resize(n);
    for (int i = 0; i < n; i++)
    {
        char c; cin >> c;
        if(c=='0') w[i]=1e9;
        else w[i]=0;
    }
    segtree seg(n);
    for (int i = 0; i < q; i++)
    {
        string s; cin >> s;
        if(s=="toggle"){
            int x; cin >> x;
            seg.update(x-1,i+1);
        }else{
            int a,b; cin >> a >> b; a--; b--;
            int qu=seg.query(a,b-1);
            cout << max(i-qu+1,(int)0) << "\n";
        }
    }
    return 0;
}

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