제출 #447474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447474		K4YAN	가로등 (APIO19_street_lamps)	C++17	20 / 100	5087 ms	12636 KiB

street_lamps

//Be Name Khoda
// 06:10 - 13:15

#include<bits/stdc++.h>
#pragma GCC optimize ("unroll-loops")

using namespace std;

typedef long long ll;
typedef long double ld;
#define all(x) x.begin(), x.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define plll pair<pll, ll>
#define piii pair<pii, int>
#define piiii pair<pii, pii>

const int mxn = 1e5 + 16;
int n, q, v, u;
string s, h, cur;
vector<piii> qu;

void input() {

    cin >> n >> q;
    cin >> s;
    cur = s;
    for(int i = 0; i < q; i++) {
        cin >> h;
        if(h == "query") {
            cin >> v >> u;
            v--, u--;
            qu.push_back({{1, v}, u});
        }
        else {
            cin >> v;
            v--;
            qu.push_back({{2, v}, v});
        }
    }

}

void solve() {

    for(int i = 0; i < qu.size(); i++) {
        if(qu[i].first.first == 1) {
            int cnt = 0;
            cur = s;
            v = qu[i].first.second, u = qu[i].second;
            for(int j = 0; j <= i; j++) {
                bool b = true;
                for(int w = v; w < u; w++) {
                    if(cur[w] == '0') {
                        b = false;
                        break;
                    }
                }
                if(b) {
                    cnt++;
                }
                if(qu[j].first.first == 2) {
                    if(cur[qu[j].second] == '1') cur[qu[j].second] = '0';
                    else {
                        cur[qu[j].second] = '1';
                    }
                }
            }
            cout << cnt << endl;
        }
    }

}

int main() {

    ios_base::sync_with_stdio(false);

    input(), solve();

    return 0;

}
/*
5 7
11011
query 1 2
query 1 2
query 1 6
query 3 4
toggle 3
query 3 4
query 1 6
*/

컴파일 시 표준 에러 (stderr) 메시지

street_lamps.cpp: In function 'void solve()':
street_lamps.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i = 0; i < qu.size(); i++) {
      |                    ~~^~~~~~~~~~~

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