Submission #1234250

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234250		dssfsuper2	Street Lamps (APIO19_street_lamps)	C++20	40 / 100	188 ms	23756 KiB

street_lamps

/*
first subtask: simulation, ez
second:you just query how many times the thing was on, you can ust count for each one
third:you have moements of turning on of each thing, you just wander the max on interval
fourth: first calculate the thing, then just min on interval
*/
#include <bits/stdc++.h>
using namespace std;
signed main(){
    int n, q;cin>>n>>q;
    string s;cin>>s;
    vector<int> a;
    for(int i = 0;i<n;i++){
        if(s[i]=='1')a.push_back(1);
        else a.push_back(0);
    }

    vector<vector<int>> events;
    bool isss2=true;
    for(int i = 0;i<q;i++){
        string ev;cin>>ev;
        if(ev=="toggle"){
            int x;cin>>x;
            events.push_back({0, x});
            
        }
        else{
            
            int x, y;cin>>x>>y;
            if(y-x!=1)isss2=false;
            events.push_back({1, x, y});
        }
    }
    //range max of "on times"
    if(isss2){
        vector<int> count=a;
        vector<int> state=a;
        vector<int> lastc(n, 0);
        for(int i = 0;i<q;i++){
            auto thing = events[i];
            if(thing[0]==0){
                if(state[thing[1]-1]==1)count[thing[1]-1]+=(i-lastc[thing[1]-1]);
                state[thing[1]-1]^=1;

                lastc[thing[1]-1]=i;
            }
            else{
                int res = count[thing[1]-1];
                if(state[thing[1]-1]==1)res+=(i-lastc[thing[1]-1]);
                cout << res << '\n';
            }
        }
        return 0;
    }
    if(n<=200 && q<=200){
        vector<vector<int>> strings={a};
        for(auto thing:events){
            if (thing[0]==0){
                a[thing[1]-1]^=1;
            }
            else{
                int tres = 0;
                for(auto strin:strings){
                    bool res = true;

                    for(int i =thing[1]-1;i<thing[2]-1;i++){
                        if(strin[i]==0)res=false;
                    }
                    if(res)tres++;
                }
                cout << tres << '\n';
            }
            strings.push_back(a);
        }
    }
}

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