algorithmStudy/BJ14503.py at main · KeonhoPark/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
n, m = map(int, input().split())
r, c, d = map(int, input().split())
data = list()
for i in range(n):
    data.append(list(map(int, input().split())))


def turn(dir):
    if dir == 0:
        return 3
    else:
        return dir - 1


def search(row, col, dir):
    if dir == 0:
        if data[row][col - 1] == 0:
            return 0
        elif data[row][col - 1] == 1:
            return 1
        elif data[row][col - 1] == 5:
            return 5
    elif dir == 1:
        if data[row - 1][col] == 0:
            return 0
        elif data[row - 1][col] == 1:
            return 1
        elif data[row - 1][col] == 5:
            return 5
    elif dir == 2:
        if data[row][col + 1] == 0:
            return 0
        elif data[row][col + 1] == 1:
            return 1
        elif data[row][col + 1] == 5:
            return 5
    elif dir == 3:
        if data[row + 1][col] == 0:
            return 0
        elif data[row + 1][col] == 1:
            return 1
        elif data[row + 1][col] == 5:
            return 5


def clean(row, col, dir):
    if dir == 0:
        data[row - 1][col] = 5
        return row - 1, col
    elif dir == 1:
        data[row][col + 1] = 5
        return row, col + 1
    elif dir == 2:
        data[row + 1][col] = 5
        return row + 1, col
    elif dir == 3:
        data[row][col - 1] = 5
        return row, col - 1


def reverse(row, col, dir):
    if dir == 0:
        return row + 1, col
    elif dir == 1:
        return row, col - 1
    elif dir == 2:
        return row - 1, col
    elif dir == 3:
        return row, col + 1


def is_wall(row, col, dir):
    if dir == 0:
        if data[row + 1][col] == 1:
            return True
        else:
            return False
    elif dir == 1:
        if data[row][col - 1] == 1:
            return True
        else:
            return False
    elif dir == 2:
        if data[row - 1][col] == 1:
            return True
        else:
            return False
    elif dir == 3:
        if data[row][col + 1] == 1:
            return True
        else:
            return False


data[r][c] = 5
count = 1
while True:
    res = search(r, c, d)
    if res == 0:
        d = turn(d)
        r, c = clean(r, c, d)
        count += 1

    else:
        i = 0
        flag = 0
        while search(r, c, d) != 0:
            d = turn(d)
            if i == 3:
                flag = 1
                break
            i += 1
        if flag == 0:
            d = turn(d)
            r, c = clean(r, c, d)
            count += 1
        else:
            if is_wall(r, c, d):
                break
            else:
                r, c = reverse(r, c, d)

print(count)