Baekjoon Online Judge 2667번 파이썬

문제 링크
https://www.acmicpc.net/problem/2667

2667번: 단지번호붙이기

파이썬 델타 값 이용하기
dx = [0,0,-1,1]
dy = [-1,1,0,0]

for i in range(4):
pointX = x + dx[i]
pointY = y + dy[i]
=>  i = 0
pointX = x , pointY = y - 1 : 왼쪽 노드
i = 1
pointX = x , pointY = y + 1 : 오른쪽 노드
i = 2
pointX = x - 1 , pointY = y : 위쪽 노드
i = 3
pointX = x + 1, pointY = y : 아래쪽 노드


정답 코드

import sys

dx = [0,0,-1,1]
dy = [-1,1,0,0]

def dfs(x,y):
  global count
  visited[x][y] = True
  if mapping[x][y] == 1:
    count += 1
    for i in range(4):
      pointX = x + dx[i]
      pointY = y + dy[i]
      if 0<= pointX < N and 0<= pointY < N:
        if visited[pointX][pointY] == False and mapping[pointX][pointY] == 1:
          dfs(pointX,pointY)

N = int(sys.stdin.readline())

mapping = []
for i in range(N):
  mapping.append(list(map(int,sys.stdin.readline().rstrip())))

result = []
count = 0
visited = [[False]*N for i in range(N)]
for i in range(N):
  for j in range(N):
    if mapping[i][j] == 1 and visited[i][j] == False:
      dfs(i,j)
      result.append(count)
      count = 0

result.sort()
print(len(result))
for i in range(len(result)):
  print(result[i])

그래프 너무 어렵다..