阿里笔试——越狱计划

def dfs(i, j):
    print("坐标：",(i, j))
    if i>n-1 or i<0 or j>m-1 or j<0:
        # print("NO")
        return "NO"
    if i == n-1 and j == m-1:
        print("YES")
        return "YES"
    global count
    count += 1
    print("步数：",count)
    x_all[i][j] = -5000
    if 0 <= i-1 <= n-1 and 0 <= j <= m-1 and x_all[i-1][j]  and int(x_all[i-1][j])>=count :
        dfs(i-1, j)
        # print("1")
    elif 0 <= (i+1) <= n-1 and 0 <= j <= m-1 and x_all[i+1][j] and int(x_all[i+1][j])>=count:
        dfs(i+1, j)
        # print("2")
    elif 0 <= (i) <=n-1 and 0 <= (j-1) <= m-1 and x_all[i][j-1] and int(x_all[i][j-1])>=count:
        dfs(i, j-1)
        # print("3")
    elif 0 <= (i) <= n-1 and 0 <= (j+1) <= m-1 and x_all[i][j+1] and int(x_all[i][j+1])>=count:
        dfs(i, j+1)
        # print("4")
    else:
        print("N0")
        return "NO"


T = int(input())
for i in range(T):
    global count
    count = 0
    n, m = list(map(int, input().split()))
    x_all = [[0]*m for _ in range(n)]
    for x in range(n):
        x_all[x] = list(map(int, input().split()))
    result = dfs(0, 0)