- Fox Ciel is going to take a path to meet her friends. The path is tiled with 1x1 square tiles. It is N tiles long and 2 tiles wide. If we imagine that the path is going from the left to the right, we can view it as a rectangle with 2 rows and N columns of tiles. The rows of the path are numbered 0 to 1 from top to bottom, and the columns of the path are numbered 0 to N-1 from left to right. Ciel starts at the tile in row 0, column 0. She has to reach the tile in row 0, column N-1.In each step, Ciel can move to an adjacent tile. Two tiles are adjacent if they share at least one point (a side or a corner).Because it rained yesterday, some tiles are covered by puddles of water. Ciel will not step on these tiles. Each character is 'W' if the tile is covered by water, and '.' otherwise.
- The constraints guarantee that the starting tile and the destination tile are never covered by water.
T indicates T(1<T<100) cases,The path is N tiles long.(1<N<500)
- Print "YES" if she can move to her destination without entering a tile which is filled with water. Otherwise, Print "NO".
using namespace std;
#define Max 500
for(i = 0; i < 2; i++)
for(int j = 0; j < N; j++)
if(Tiles== 'W' || Tiles[N-1] == 'W')
if(Tiles[i]=='W' && Tiles[i]=='W')