11315. 오목 판정

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AXaSUPYqPYMDFASQ&categoryId=AXaSUPYqPYMDFASQ&categoryType=CODE&problemTitle=%EC%98%A4%EB%AA%A9&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 

SW Expert Academy

def omok():
    for i in range(N):
        for j in range(N):
            if arr[i][j] == 'o':
                for ni, nj in [(0,1), (1,0), (1, 1), (1, -1)]:
                    count = 0
                    for k in range(1, 5): 
                        di, dj = i + (k*ni), j + (k*nj)
                        if 0<=di<N and 0<=dj<N:
                            if arr[di][dj] == 'o': 
                                count += 1  # 돌이 있는 자리 기준 한 방향으로 4개 더 있으면 
                        if count == 4:
                            return 'YES'
    return 'NO'
 
T = int(input())
for tc in range(1, T + 1):
    N = int(input())
    arr = [input() for _ in range(N)]
    print(f'#{tc}', omok())