백준 12946번 육각 보드 (Python 3)

 

Baekjoon online judge 12946번 파이썬

 

링크

https://www.acmicpc.net/problem/12946

12946번: 육각 보드

 

소스코드

import sys
input=sys.stdin.readline
index=[[-1,0],[-1,1],[0,-1],[0,1],[1,0],[1,-1]]
sys.setrecursionlimit(10**8)

color=0
def dfs(y,x):
    global color
    color=max(color,1)

    for indy,indx in index:
        ny=indy+y
        nx=indx+x
        if 0<=nx<n and 0<=ny<n and map_data[ny][nx]=='X':
            if visited[ny][nx]==0:
                visited[ny][nx]=-visited[y][x]
                dfs(ny,nx)
                color=max(color,2)
            else:
                if visited[ny][nx]==visited[y][x]:
                    color=max(color,3)
                    return


n=int(input())
map_data=[list(input().rstrip()) for _ in range(n)]
visited=[[0 for _ in range(n)] for _ in range(n)]

for i in range(n):
    for j in range(n):
        if map_data[i][j]=='X' and visited[i][j]==0:
            visited[i][j]=1
            dfs(i,j)
print(color)