cf766div2 Anot shading

There is a grid with n rows and m columns. Some cells are colored black, and the rest of the cells are colored white.

In one operation, you can select some black cell and do exactly one of the following:

color all cells in its row black, or color all cells in its column black. You are given two integers r and c. Find the minimum number of operations required to make the cell in row r and column c black, or determine that it is impossible.

Input The input consists of multiple test cases. The first line contains an integer t (1≤t≤100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains four integers n, m, r, and c (1≤n,m≤50; 1≤r≤n; 1≤c≤m) — the number of rows and the number of columns in the grid, and the row and column of the cell you need to turn black, respectively.

Then n lines follow, each containing m characters. Each of these characters is either ‘B’ or ‘W’ — a black and a white cell, respectively.

Output For each test case, if it is impossible to make the cell in row r and column c black, output −1.

Otherwise, output a single integer — the minimum number of operations required to make the cell in row r and column c black.

input

9
3 5 1 4
WBWWW
BBBWB
WWBBB
4 3 2 1
BWW
BBW
WBB
WWB
2 3 2 2
WWW
WWW
2 2 1 1
WW
WB
5 9 5 9
WWWWWWWWW
WBWBWBBBW
WBBBWWBWW
WBWBWBBBW
WWWWWWWWW
1 1 1 1
B
1 1 1 1
W
1 2 1 1
WB
2 1 1 1
W
B

output

1
0
-1
2
2
0
-1
1
1

#include<iostream>
using namespace std;
int main() {
	int t;
	cin >> t;
	while (t--) {
		int n, m, r, c;
		cin >> n >> m >> r >> c;
		int f = 0, f1 = 0, f2 = 0;
		for (int i = 0; i < n; i++) {
			string s;
			cin >> s;
			for (int j = 0; j < m; j++) {
				if (s[j] == 'B')f = 1;//标记有可以选择的黑色格子
				if (s[j] == 'B' && i == r - 1 && j == c - 1)f1 = 1;//标记当前格子是要涂黑的格子
				else if (s[j] == 'B' && (i == r - 1 || j == c - 1))f2 = 1;//当前格子在要涂黑格子的行/列上
			}
			
		}
		if (!f)cout << -1 << endl;//如果没有可以选择的黑格子那就无法处理
		else {
			if (f1)cout << 0 << endl;//如果是当前格子 那就不用涂黑
			else if (f2)cout << 1 << endl;//如果在要涂黑的格子的行/列上 那就只要处理一次
			else cout << 2 << endl;//其余情况 两次一定能处理完
		}

	}
}