fork download
  1. t = int(input())
  2.  
  3. for _ in range(t):
  4. n, m = map(int, input().split())
  5. grid = [input() for _ in range(n)]
  6.  
  7. possible = True
  8.  
  9. # Check horizontal pairs
  10. for i in range(n):
  11. for j in range(m - 1):
  12. if grid[i][j] != grid[i][j + 1]:
  13. possible = False
  14.  
  15. # Check vertical pairs
  16. for j in range(m):
  17. for i in range(n - 1):
  18. if grid[i][j] != grid[i + 1][j]:
  19. possible = False
  20.  
  21. if possible:
  22. print("YES")
  23. else:
  24. print("NO")
  25.  
Success #stdin #stdout 0.03s 9800KB
stdin
8
2 1
W
B
6 6
WWWWBW
WBWWWW
BBBWWW
BWWWBB
WWBWBB
BBBWBW
1 1
W
2 2
BB
BB
3 4
BWBW
WBWB
BWBW
4 2
BB
BB
WW
WW
4 4
WWBW
BBWB
WWBB
BBBB
1 5
WBBWB
stdout
NO
NO
YES
YES
NO
NO
NO
NO