题库练习 Not Shading
← 上一题 下一题 →

A14813 | Not Shading

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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.

输入格式

The input consists of multiple test cases. The first line contains an integer $t$ ( $1 \leq t \leq 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 \leq n, m \leq 50$ ; $1 \leq r \leq n$ ; $1 \leq c \leq 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.

输出格式

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.

输入输出样例

输入 #1
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
输出 #1
1
0
-1
2
2
0
-1
1
1
C++ 编辑器
输入
输出