제출 #252403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
252403		Sugardorj	Street Lamps (APIO19_street_lamps)	C++14	40 / 100	1018 ms	17552 KiB

street_lamps

#include <bits/stdc++.h>
using namespace std;
int b[323567],c[223456],a[323456],tt,d[234564];
int x,m,n,t,k,l;
int i , j,r,s,y,z;
string p[12345],q;
vector <long long >v[345674];
int main(){
    cin>> n>>m>>p[0];
    if (n>100||m>100){
        for (i = 1; i<=m; i ++){
            cin >>q;
            if (q[0]=='t'){
                cin >>x;
                x--;

                if (p[0][x]=='1'){
                    p[0][x]='0';
                    a[x]+=i-b[x];
                    
                }
                else {
                    p[0][x]='1';
                    b[x]=i;
                }    
            }
            else {
                cin >>x>>y;
                x--;
                s= a[x];
                if (p[0][x]=='1')
                    s += i-b[x];
                cout << s<<endl;
            }
        }
        //cout << "duus";
        return 0;
    }
    for (i = 1; i <=m; i ++){
        cin >> q;
        p[i]=p[i-1];
        if (q[0]=='t'){
            cin >>x;
            x--;
            if (p[i][x]=='1')
                p[i][x]='0';
            else p[i][x]='1';
        }
        else {
            cin >>x>>y;
            x--;
            y--;
            s=0;
            for (k = 0; k<i; k ++){
                t=1;
                for (j = x; j<y; j ++){
                    if (p[k][j]=='0')
                        t=0;
                }
                s+=t;
            }
            cout << s<<endl;
        }
        //cout << p[i]<<endl;
    }
}

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