import sys
sys.setrecursionlimit(80800)
def dfs(i,j):
global flag
isvist[i][j]=1
if arr[i][j]=='t':
flag=1
for x,y in [(i+1,j),(i-1,j),(i,j+1),(i,j-1)]:
if x>=0 and x<n and y>=0 and y<m and arr[x][y]!='x' and isvist[x][y]==0:
if flag==0:
dfs(x,y)
t=int(input())
for _ in range(t):
try:
flag=0
n,m=map(int,input().split())
arr=[]
isvist=[[0]*m for _ in range(n)]
for _ in range(n):
arr.append(list(input()))
for i in range(n):
for j in range(m):
if arr[i][j]=="s":
dfs(i,j)
if flag==1:print('YES')
else:print('NO')
except:
break
有谁知道第二个测试点是什么嘛，什么这个只过了75，递归深度已经调到极限了，80900会超时
😭😭😭😭
查看5道真题和解析
