1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include <bits/stdc++.h>
#include "osalib.h"
#define MP make_pair
#define PB push_back
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

int any_i, any_j;
const int N = 1e3 + 5;
int forb[N][N];
int osada[N][N];
int n, m;
int cnt_osady;
void NowaWyspa(int nn, int mm, char** board) {
  n = nn;
  m = mm;
  FOR (i, 0, n + 1) {
    FOR (j, 0, m + 1) {
      forb[i][j] = 1;
    }
  }
  RE (i, n) {
    RE (j, m) {
      if (board[i - 1][j - 1] != 'W') {
        forb[i][j] = 0;
      }
      if (board[i - 1][j - 1] == 'K') {
        osada[i][j] = 1;
        cnt_osady++;
        any_i = i;
        any_j = j;
      }
    }
  }
  //debug(any_i, any_j);
}
int di[] = {1, -1, 0, 0};
int dj[] = {0, 0, 1, -1};

int last_vis[N][N];
int phase;
int Dfs(int i, int j) {
  last_vis[i][j] = phase;
  int sz = osada[i][j];
//   if (osada[i][j]) {
//     debug(i, j);
//   }
//   debug(i, j, forb[i][j]);
  REP (dir, 4) {
    int ni = i + di[dir];
    int nj = j + dj[dir];
    //debug(i, j, ni, nj);
    if (last_vis[ni][nj] != phase && !forb[ni][nj]) {
      sz += Dfs(ni, nj);
    }
  }
  return sz;
}      

int NowaWarownia(int i, int j) {
//   FOR (i, 0, n + 1) {
//     FOR (j, 0, m + 1) {
//       cerr<<forb[i][j];
//     }
//     cerr<<endl;
//   }
  if (cnt_osady == 0) { return 1; }
  forb[i][j] = 1;
  phase++;
  //debug(any_i, any_j);
  int got = Dfs(any_i, any_j);
  //debug(got);
  if (got == cnt_osady) {
    return 1;
  } else {
    forb[i][j] = false;
    return 0;
  }
}

void PrzeniesOsade(int r1, int c1, int r2, int c2) {
//   cerr<<"Osady:\n";
//   RE (i, n) {
//     RE (j, m) {
//       cerr<<osada[i][j];
//     }
//     cerr<<endl;
//   }
  //debug(r1, c1, r2, c2);
  //debug(osada[r1][c1], osada[r2][c2]);
  swap(osada[r1][c1], osada[r2][c2]);
  any_i = r2;
  any_j = c2;
  //debug(osada[r1][c1], osada[r2][c2]);
}