swea14190. 민코씨의 꽃밭(python)

https://swexpertacademy.com/main/code/userProblem/userProblemDetail.do?contestProbId=AX_PdObKe04DFARi&categoryId=AX_PdObKe04DFARi&categoryType=CODE 

SW Expert Academy

from collections import deque
T = int(input())
for tc in range(1,T+1):
    row,col = map(int,input().split())
    arr=[list(map(int,input().split())) for _ in range(row)]
    sy,sx=map(int,input().split())
    visit = [[0] * col for _ in range(row)]
    time=1 #1일부터니까
    lst=[]

    q =deque()
    q.append((sy,sx,time))
    visit[sy][sx]= 1
    lst.append(arr[sy][sx]+time)


    def bfs():
        if q:
            temp=q[0][2] #날짜
        global time,lst
        while q:
            ny,nx,nmove =q.popleft()


            if nmove !=temp:
                q.append((ny,nx,nmove))
                break

            directy=[-1,1,0,0]
            directx=[0,0,-1,1]
            for i in range(4):
                dy=ny+directy[i]
                dx=nx+directx[i]

                if 0<=dy<row and 0<=dx<col:
                    if arr[dy][dx]>0 and visit[dy][dx]==0:
                        visit[dy][dx]=1
                        q.append((dy,dx,nmove+1))
                        lst.append(arr[dy][dx]+time)

    Mflower=0
    Mtime=0
    def calculation(): #최대 꽃의 갯수와 그에 해당하는 해당 일 구하기
        global Mflower,Mtime,time,lst
        flower = 0
        lst.sort()
        for i in range(len(lst)):
            if lst[i]>time:
                lst=lst[i:]
                break
        flower=len(lst)
        if Mflower<flower:
            Mflower=flower
            Mtime = time



    while q: #q가 있을 때까지 while문 돌기
        calculation()
        time += 1
        bfs()

    print(f'#{tc} {Mtime}일 {Mflower}개')