Submission #50405635

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/segtree>

bool apply(bool a, bool b) {
    return a & b;
}

bool unit(void) {
    return true;
}

void solve(std::istream& is, std::ostream& os) {
    using Num = int;
    Num n, q;
    std::string s;
    is >> n >> q >> s;

    const Num size = n + 1;
    using SegTree = atcoder::segtree<bool, apply, unit>;
    SegTree tree(size);

    tree.set(0, true);
    for(Num i{1}; i<n; ++i) {
        const auto d = (s.at(i-1) != s.at(i));
        tree.set(i, d);
    }
    tree.set(n, true);

    auto flip = [&](Num pos) {
        if ((pos > 0) && (pos < n)) {
            tree.set(pos, !tree.get(pos));
        }
    };

    while(q-- > 0) {
        Num cmd, l, r;
        is >> cmd >> l >> r;

        if (cmd == 1) {
            flip(l - 1);
            flip(r);
        } else {
            if (tree.prod(l, r)) {
                os << "Yes\n";
            } else {
                os << "No\n";
            }
        }
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result