[Python]16918. 봄버맨

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

16918번: 봄버맨

---

 

비교적 간단한 시뮬레이션 문제

direction = ((-1, 0), (1, 0), (0, -1), (0, 1))
r, c, n = map(int, input().split())
MAP = [list(input()) for _ in range(r)]
time = [[-1]*c for _ in range(r)]
cnt = 0
 
# 초기화
for i in range(r):
    for j in range(c):
        if MAP[i][j] == 'O':
            time[i][j] = 0
 
while cnt != n:
    boom = []
    for i in range(r):
        for j in range(c):
            if MAP[i][j] == '.' and time[i][j] == -1 and cnt != 0: # 0초일땐 무시
                MAP[i][j] = 'O'
                time[i][j] = 0
            elif MAP[i][j] == 'O' and time[i][j] < 3:
                time[i][j] += 1
                if time[i][j] == 3:
                    boom.append((i,j)) # 폭발 리스트를 만들어서 터지는 폭탄 삽입
 
    for i,j in boom:
        MAP[i][j] = '.'
        time[i][j] = -1
        for d in direction:
            ny = i + d[0]
            nx = j + d[1]
            if 0 <= ny < r and 0 <= nx < c:
                MAP[ny][nx] = '.'
                time[ny][nx] = -1
 
    cnt += 1
 
for m in MAP:
    print(''.join(m))