Advertisement
Guest User

Tigr

a guest
Aug 19th, 2019
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.61 KB | None | 0 0
  1. from collections import deque
  2. n, m = map(int, input().split())
  3. a = [list(input()) for _ in range(n)]
  4. x = 0
  5.  
  6. for i in range(n):
  7.     for j in range(m):
  8.         if a[i][j] == 'T':
  9.             yt = i
  10.             xt = j
  11.            
  12. q = deque()
  13. q.append([n-2, m-2, 0])
  14. a[n-2][m-2] = 0
  15. d = ((0, 1), (0, -1), (1, 0), (-1, 0))
  16. while q:
  17.     t = q.popleft()
  18.     for e in d:
  19.         yy, xx = t[0]+e[0], t[1]+e[1]
  20.         if str(a[yy][xx]) in '.T':
  21.             a[yy][xx] = t[2] + 1
  22.             q.append([yy, xx, t[2] + 1])
  23.  
  24. if a[yt][xt] <= a[1][1]:
  25.     print(a[1][1], '\nNo')
  26. else:
  27.     print(a[1][1], '\nYes')
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement