Submission #70440798

---

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); }

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

#include <atcoder/segtree>

using namespace std;

using ll = long long;

using T = array<array<int, 3>, 3>;

constexpr int INF = 1e9;

constexpr T id = {array<int, 3>{-1, INF, INF}, array<int, 3>{INF, -1, INF}, array<int, 3>{INF, INF, -1}};

T gen(vector<bool> v) {
    T res;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            res[i][j] = INF;
        }
    }
    for (int i = 0; i < 3; i++) {
        if (not v[i]) {
            continue;
        }
        res[i][i] = 0;
        for (int j : {1, 2}) {
            if (i + j >= 3 or not v[i + j]) {
                break;
            }
            res[i][i + j] = j;
        }
        for (int j : {1, 2}) {
            if (i - j < 0 or not v[i - j]) {
                break;
            }
            res[i][i - j] = j;
        }
    }
    return res;
}

T op(T l, T r) {
    T res;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            res[i][j] = INF;
        }
    }
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            for (int k = 0; k < 3; k++) {
                chmin(res[i][k], l[i][j] + 1 + r[j][k]);
            }
        }
    }
    return res;
};

T e() { return id; }

void solve() {
    int N;
    cin >> N;
    vector<string> S(3);
    for (int i = 0; i < 3; i++) {
        cin >> S[i];
    }

    vector<T> init;
    for (int i = 0; i < N; i++) {
        vector<bool> v(3);
        for (int j = 0; j < 3; j++) {
            v[j] = (S[j][i] == '.');
        }
        init.emplace_back(gen(v));
    }
    atcoder::segtree<T, op, e> seg(init);
    auto query = [&](int r, int c) -> int {
        S[r][c] = (S[r][c] == '#' ? '.' : '#');
        vector<bool> v(3);
        for (int i = 0; i < 3; i++) {
            v[i] = (S[i][c] == '.');
        }
        seg.set(c, gen(v));
        auto prod = seg.all_prod();
        return prod[0][2];
    };

    int Q;
    cin >> Q;
    for (; Q--;) {
        int r, c;
        cin >> r >> c;
        auto ans = query(--r, --c);
        cout << (ans == INF ? -1 : ans) << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}

Submission Info

Judge Result