SWEA D3 11315 오목 판정

이 코드는 Python으로 작성했습니다.

T = int(input())

for tc in range(1, T + 1):
    N = int(input())
    board = [list(input()) for _ in range(N)]
    res = 0

    di = [0, 1, 1, 1]
    dj = [1, 1, 0, -1]

    for i in range(N):
        for j in range(N):
            if board[i][j] == 'o':
                for k in range(4):
                    cnt = 1
                    ni, nj = i + di[k], j + dj[k]
                    while 0 <= ni < N and 0 <= nj < N and board[ni][nj] == 'o':
                        cnt += 1
                        ni, nj = ni + di[k], nj + dj[k]
                    if cnt >= 5:
                        res = 1
                        break
                if res:
                    break
        if res:
            break

    if res:
        print('#{} YES'.format(tc))
    else:
        print('#{} NO'.format(tc))

 

문제 출처 : SW Expert Academy

SW Expert Academy