Submission #70454143

---

Source Code Expand

#define LOCAL
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
constexpr inline int lg2(int64 x) { return x == 0 ? -1 : sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
constexpr inline int64 p2ceil(int64 x) { return 1LL << (lg2(x - 1) + 1); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
inline void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
inline void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }
inline int mod(int x) { return x >= MOD ? x - MOD : x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int M = 3;
// typedef array<array<int, M>, M> mat;
typedef array<int, M> vec;

struct mat : array<array<int, M>, M> {
  mat() {
    for (int i = 0; i < M; ++i) {
      for (int j = 0; j < M; ++j) {
        (*this)[i][j] = (i == j ? 0 : inf<int>);
      }
    }
  }
};
mat operator *(const mat& a, const mat& b) {
  mat ret {};
  for (int i = 0; i < M; ++i) {
    for (int j = 0; j < M; ++j) {
      ret[i][j] = inf<int>;
      for (int k = 0; k < M; ++k) {
        ckmin(ret[i][j], a[i][k] + b[k][j]);
      }
    }
  }
  return ret;
}

vec operator *(const vec& b, const mat& a) {
  vec ret {};
  for (int i = 0; i < M; ++i) {
    ret[i] = inf<int>;
    for (int j = 0; j < M; ++j) {
      ckmin(ret[i], a[j][i] + b[j]);
    }
  }
  return ret;
}

template<size_t N,
         class T,
         T (*op)(const T&, const T&),
         T (*e)()>
struct SegmentTree {
  struct Node {
    Node *left, *right;
    T val;
    void pushup() { val = op(left->val, right->val); }
  };
  Node pool[N << 1], *last, *rt;
  int n;
  SegmentTree(const vector<T>& v): n(SZ(v)) {
    last = pool;
    rt = build(0, n, v);
  }
  SegmentTree(int n): SegmentTree(vector<T>(n, e())) {}
  Node* build(int a, int b, const vector<T>& v) {
    Node* ret = last++;
    if (a + 1 == b) { ret->val = v[a]; return ret; }
    int mid = (a + b) / 2;
    ret->left = build(a, mid, v);
    ret->right = build(mid, b, v);
    ret->pushup();
    return ret;
  }
  void set(int pos, T val) { return set(rt, 0, n, pos, val); }
  void set(Node* cur, int a, int b, int pos, T val) {
    if (pos < a || pos >= b) return;
    if (a + 1 == b) { cur->val = val; return; }
    int mid = (a + b) / 2;
    set(cur->left, a, mid, pos, val);
    set(cur->right, mid, b, pos, val);
    cur->pushup();
  }
  T query(int ll, int rr) { return query(rt, 0, n, ll, rr); }
  T query(Node* cur, int a, int b, int ll, int rr) {
    if (ll >= rr || a >= rr || b <= ll) return e();
    if (a >= ll && b <= rr) return cur->val;
    int mid = (a + b) / 2;
    return op(query(cur->left, a, mid, ll, rr), query(cur->right, mid, b, ll, rr));
  }
};

const int N = 2e5 + 10;

// sum
template<typename T> T add(const T& a, const T& b) { return a * b; }
template<typename T> T id() { return T(); }
using segtree = SegmentTree<N, mat, add, id>;


int main() {
  int n;
  cin >> n;
  vector<string> s(3);
  for (int i = 0; i < 3; ++i) cin >> s[i];
  vector<mat> A(8);
  for (int mask = 0; mask < 8; ++mask) {
    auto& cur = A[mask];
    bitset<3> v(mask);
    for (int i = 0; i < 3; ++i) {
      cur[i] = {inf<int>, inf<int>, inf<int>};
      queue<int> Q;
      if (!v[i]) {
        cur[i][i] = 1;
        Q.push(i);
      }
      while (!Q.empty()) {
        auto j = Q.front();
        Q.pop();
        if (j - 1 >= 0 && !v[j - 1] && cur[i][j - 1] > cur[i][j] + 1) {
          cur[i][j - 1] = cur[i][j] + 1;
          Q.push(j - 1);
        }
        if (j + 1 < 3 && !v[j + 1] && cur[i][j + 1] > cur[i][j] + 1) {
          cur[i][j + 1] = cur[i][j] + 1;
          Q.push(j + 1);
        }
      }
    }
  }
  vector<mat> v(n);
  for (int j = 0; j < n; ++j) {
    int mask = 0;
    for (int i = 0; i < 3; ++i) {
      mask |= (s[i][j] == '#') << i;
    }
    v[j] = A[mask];
    // trace(j, mask, v[j]);
  }

  segtree tr(v);
  int q;
  cin >> q;
  while (q--) {
    int x, y;
    cin >> x >> y;
    --x; --y;
    s[x][y] ^= '#' ^ '.';
    int mask = 0;
    for (int i = 0; i < 3; ++i) {
      mask |= (s[i][y] == '#') << i;
    }
    tr.set(y, A[mask]);
    auto cur = tr.query(1, n);
    // trace(cur);
    vec V {};
    V[0] = s[0][0] == '.' ? 0 : inf<int>;
    V[1] = s[0][0] == '.' && s[1][0] == '.' ? 1 : inf<int>;
    V[2] = s[0][0] == '.' && s[1][0] == '.' && s[2][0] == '.' ? 2 :
      inf<int>;
    // trace(V);
    auto W = V * cur;
    cout << (W[2] < inf<int> ? W[2] : -1) << '\n';
  }
  return 0;
}

Submission Info

Judge Result