oj.uz

답안 #934197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934197 2024-02-27T00:49:39 Z irmuun 가로등 (APIO19_street_lamps) C++17
40 / 100
 85 ms 15804 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,q;
    cin>>n>>q;
    char s[n+5],cur[n+5];
    for(ll i=1;i<=n;i++){
        cin>>s[i];
    }
    if(n<=100&&q<=100){
        vector<pair<ll,ll>>que(q);
        for(ll i=0;i<q;i++){
            string t;
            cin>>t;
            if(t=="toggle"){
                ll j;
                cin>>j;
                que[i]={j,-1};
            }
            else{
                ll a,b;
                cin>>a>>b;
                que[i]={a,b};
                ll ans=0;
                for(ll j=1;j<=n;j++){
                    cur[j]=s[j];
                }
                for(ll j=0;j<=i;j++){
                    bool ok=true;
                    for(ll k=a;k<b;k++){
                        if(cur[k]=='0'){
                            ok=false;
                            break;
                        }
                    }
                    if(ok){
                        ans++;
                    }
                    if(que[j].ss==-1){
                        ll p=que[j].ff;
                        if(cur[p]=='1') cur[p]='0';
                        else cur[p]='1';
                    }
                }
                cout<<ans<<"\n";
            }
        }
        return 0;
    }
    vector<pair<ll,ll>>bef(n+1);
    for(ll i=1;i<=n;i++){
        bef[i].ff=0;
        bef[i].ss=s[i]-'0';
    }
    vector<ll>ans(n+1,0);
    for(ll i=1;i<=q;i++){
        string t;
        cin>>t;
        if(t=="toggle"){
            ll j;
            cin>>j;
            if(bef[j].ss==1){
                ans[j]+=i-bef[j].ff;
            }
            bef[j].ff=i;
            bef[j].ss=1-bef[j].ss;
        }
        else{
            ll a,b;
            cin>>a>>b;
            if(a==b-1){
                if(bef[a].ss==1){
                    ans[a]+=i-bef[a].ff;
                }
                bef[a].ff=i;
                cout<<ans[a]<<"\n";
            }
        }
    }
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 1364 KB Output is correct
2 Correct 59 ms 4688 KB Output is correct
3 Correct 60 ms 5476 KB Output is correct
4 Correct 75 ms 13652 KB Output is correct
5 Correct 85 ms 14160 KB Output is correct
6 Correct 69 ms 13652 KB Output is correct
7 Correct 83 ms 14480 KB Output is correct
8 Correct 85 ms 15804 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 55 ms 1364 KB Output is correct
9 Correct 59 ms 4688 KB Output is correct
10 Correct 60 ms 5476 KB Output is correct
11 Correct 75 ms 13652 KB Output is correct
12 Correct 85 ms 14160 KB Output is correct
13 Correct 69 ms 13652 KB Output is correct
14 Correct 83 ms 14480 KB Output is correct
15 Correct 85 ms 15804 KB Output is correct
16 Incorrect 1 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -