提出 #70457812

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using S = array<array<long long, 3>, 3>;
S op(S a, S b) {
	//if (a[0][0] == -1)return b;
	//if (b[0][0] == -1)return a;

	S ret;
	rep(i, 3)rep(j, 3) {
		ret[i][j] = INF;
	}
	rep(i, 3)rep(j, 3)rep(k, 3) {
		chmin(ret[i][j], a[i][k] + b[k][j]);
	}
	return ret;
}
S e() {
	S ret;
	rep(i, 3)rep(j, 3) ret[i][j] = INF;
	rep(i, 3)ret[i][i] = 0;
	return ret;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<string>s(3);
	rep(i, 3)cin >> s[i];
	auto init = [&](int type)->S {
		S ret;
		rep(i, 3)rep(j, 3) ret[i][j] = INF;
		if (type == 0) {//000
			ret[0] = { 0,1,2 };
			ret[1] = { 1,0,1 };
			ret[2] = { 2,1,0 };
		}
		else if (type == 1) {//100
			ret[0] = { INF,INF,INF };
			ret[1] = { INF,0,1 };
			ret[2] = { INF,1,0 };
		}
		else if (type == 2) {//010
			ret[0] = { 0,INF,INF };
			ret[1] = { INF,INF,INF };
			ret[2] = { INF,INF,0 };
		}
		else if (type == 3) {//110
			ret[0] = { INF,INF,INF };
			ret[1] = { INF,INF,INF };
			ret[2] = { INF,INF,0 };
		}
		else if (type == 4) {//001
			ret[0] = { 0,1,INF };
			ret[1] = { 1,0,INF };
			ret[2] = { INF,INF,INF };
		}
		else if (type == 5) {//101
			ret[0] = { INF,INF,INF };
			ret[1] = { INF,0,INF };
			ret[2] = { INF,INF,INF };
		}
		else if (type == 6) {//011
			ret[0] = { 0,INF,INF };
			ret[1] = { INF,INF,INF };
			ret[2] = { INF,INF,INF };
		}
		else if (type == 7) {//111
			ret[0] = { INF,INF,INF };
			ret[1] = { INF,INF,INF };
			ret[2] = { INF,INF,INF };
		}
		return ret;
	};
	auto bit = [&](int n)->int {
		int res = 0;
		if (s[0][n] == '#')res += 1;
		if (s[1][n] == '#')res += 2;
		if (s[2][n] == '#')res += 4;
		return res;
	};
	segtree<S, op, e>seg(n);
	rep(i, n) {
		auto b = bit(i);
		seg.set(i, init(b));
	}
	/*	rep(i, n) {
			auto get = seg.get(i);
			rep(i, 3) {
				rep(j, 3) {
					cout << get[i][j] << " ";
				}cout << endl;
			}cout << endl;
		}
		cout << endl;
		cout << endl;
		cout << endl;
		cout << endl;
		{
			auto all = seg.all_prod();
			rep(i, 3) {
				rep(j, 3) {
					cout << all[i][j] << " ";
				}cout << endl;
			}cout << endl;
		}*/
	int q; cin >> q;
	while (q--) {
		int r, c; cin >> r >> c;
		r--, c--;
		if (s[r][c] == '#')s[r][c] = '.';
		else s[r][c] = '#';

		auto b = bit(c);
		seg.set(c, init(b));
		/*rep(i, 3)cout << s[i] << endl;
		cout << endl;
		{
			auto all = seg.all_prod();
			rep(i, 3) {
				rep(j, 3) {
					cout << all[i][j] << " ";
				}cout << endl;
			}cout << endl;
		}*/

		auto get = seg.all_prod();
		auto ans = get[0][2] + n - 1;
		if (ans >= INF)ans = -1;
		cout << ans << endl;
	}
	return 0;
}

提出情報

ジャッジ結果