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 = False
  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 = True
  14. break
  15. if possible:
  16. break
  17.  
  18. # Check vertical pairs
  19. if not possible:
  20. for j in range(m):
  21. for i in range(n - 1):
  22. if grid[i][j] == grid[i + 1][j]:
  23. possible = True
  24. break
  25. if possible:
  26. break
  27.  
  28. if possible:
  29. print("YES")
  30. else:
  31. print("NO")
  32.  
Success #stdin #stdout 0.05s 9768KB
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
YES
NO
YES
NO
YES
YES
YES