#include //#include using namespace std; //using namespace atcoder; using ll = long long; //using mint = modint998244353; struct UnionFind { int ngroup, N; vector par, siz; UnionFind(int _N) : N(_N), par(_N), siz(_N){ ngroup = _N; for(int i = 0; i < N; i++) par[i] = i, siz[i] = 1; } inline int root(int x) { if (par[x] == x) return x; return par[x] = root(par[x]); } int unite(int x, int y) { int rx = root(x), ry = root(y); if (rx == ry) return rx; ngroup--; if (siz[rx] > siz[ry]) swap(rx, ry); par[rx] = ry; siz[ry] += siz[rx]; return ry; } inline bool same(int x, int y) { int rx = root(x), ry = root(y); return rx == ry; } inline int size(int x) {return siz[root(x)];} int group_count() {return ngroup;} vector> groups(){ vector rev(N); int nrt=0; for (int i=0; i> res(nrt); for (int i=0; i> N; vector A(N); vector ans(N); for (int i=0; i> A[i]; UnionFind uf(N); for (int i=0; i> groups = uf.groups(); N = groups.size(); vector vor(N); for (int i=0; i val(M); for (int i=0; i>j & 1) W |= vor[j]; else B |= vor[j]; } val[i] = W*B; mx = max(mx, val[i]); } cout << mx << endl; for (int i=0; i>j & 1){ for (auto x : groups[j]) ans[x] = 'W'; } else{ for (auto x : groups[j]) ans[x] = 'B'; } } } for (auto x : ans) cout << x; cout << endl; return 0; }