[python] 백준 4396 - 지뢰 찾기

출처 : 백준, https://www.acmicpc.net/problem/4396

4396번: 지뢰 찾기

 

 

풀이

 

def makeNumber(current, map, output):
  i, j = current
  di = [0, 1, -1, 0, -1, -1, 1, 1]
  dj = [1, 0, 0, -1, -1, 1, -1, 1]
  mine = 0

  if map[i][j] == '*':
    return True

  for index in range(8):
    ni = i + di[index]
    nj = j + dj[index]
    
    if 0 <= ni < len(map) and 0 <= nj < len(map) and map[ni][nj] == '*':
      mine += 1

  output[i][j] = mine
  
  return False

n = int(input())
map = [list(input()) for _ in range(n)]
open = [list(input()) for _ in range(n)]
output = [list('.' for _ in range(n)) for _ in range(n)]
mine = False

for i in range(n):
  for j in range(n):
    if open[i][j] == 'x':
      mine |= makeNumber((i, j), map, output)

if mine:
  for i in range(n):
    for j in range(n):
      if map[i][j] == '*':
        output[i][j] = '*'

for line in output:
  for char in line:
    print(char, end='')
  print()

 

---

 

시간 복잡도

 

O(N^2)

 

알게 된 점

 

-

 

고찰

 

-