프로그래머스 - 거리두기 확인하기 (L2)

 1dx = [-1, 1, 0, 0]
 2dy = [0, 0, -1, 1]
 3def quest(table):
 4    table = [list(line) for line in table]
 5    for j in range(5):
 6        for i in range(5):
 7            if table[i][j] == 'P':
 8                flag = [False]*4
 9                target = []
10                for k in range(4):
11                    nx = i+dx[k]
12                    ny = j+dy[k]
13                    if 0 <= nx < 5 and 0 <= ny < 5:
14                        target.append((nx, ny))
15                        flag[k] = True
16
17                for x, y in target:
18                    if table[x][y] == 'C' or table[x][y] == 'P':
19                        return 0
20                    if table[x][y] == 'O':
21                        table[x][y] = 'C'
22
23                target = []
24                if flag[0] and flag[2] and table[i-1][j] == 'O' and table[i][j-1] == 'O':
25                    target.append((i-1, j-1))
26                if flag[0] and flag[3] and table[i-1][j] == 'O' and table[i][j+1] == 'O':
27                    target.append((i-1, j+1))
28                if flag[1] and flag[2] and table[i+1][j] == 'O' and table[i][j-1] == 'O':
29                    target.append((i+1, j-1))
30                if flag[1] and flag[3] and table[i+1][j] == 'O' and table[i][j+1] == 'O':
31                    target.append((i+1, j+1))
32
33                for x, y in target:
34                    if table[x][y] == 'P':
35                        return 0
36    return 1
37
38def solution(places):
39    answer = []
40    for table in places:
41        answer.append(quest(table))
42    return answer