Today we will play a red and white shading game (no, this isn't the Russian Civil War; these are only the shades of the Canadian banner). You are given a n×m matrix of "R", "W", and "." characters. "R" is red, "W" is white and "." is clear. The neighbors of a cell are those that share an edge with it (those that main offer a corner don't count).
Correct answer will be upvoted else downvoted.
Today we will play a red and white shading game (no, this isn't the Russian Civil War; these are only the shades of the Canadian banner).
You are given a n×m matrix of "R", "W", and "." characters. "R" is red, "W" is white and "." is clear. The neighbors of a cell are those that share an edge with it (those that main offer a corner don't count).
Your responsibility is to shading the clear cells red or white so every red cell just has white neighbors (and no red ones) and each white cell just has red neighbors (and no white ones). You are not permitted to recolour currently hued cells.
Input
The primary line contains t (1≤t≤100), the number of experiments.
In each experiment, the principal line will contain n (1≤n≤50) and m (1≤m≤50), the tallness and width of the network separately.
The following n lines will contain the matrix. Each character of the matrix is either 'R', 'W', or '.'.
Output
For each experiment, output "YES" in case there is a legitimate matrix or "NO" in case there isn't.
In case there is, output the network on the following n lines. In case there are numerous replies, print any.
In the output, the "YES"s and "NO"s are case-coldhearted, implying that outputs, for example, "yEs" and "nO" are legitimate. In any case, the matrix is case-touchy.
Step by step
Solved in 3 steps with 1 images
