[백준] 14891번_톱니바퀴

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

14891번: 톱니바퀴

def rotate(num,direct):
    if direct == 1:
        gear[num] = [gear[num][7]] + gear[num][:7]
    else:
        gear[num] = gear[num][1:] + [gear[num][0]]

def chain(num,direct):
    visited[num] = True
    front = num - 1; rear = num + 1
    if (front>0 and not visited[front]):
        if gear[num][-2] != gear[front][2]:
            chain(front,direct*(-1))
    if (rear<5 and not visited[rear]):
        if gear[num][2] != gear[rear][-2]:
            chain(rear,direct*(-1))
    rotate(num,direct)


gear = [[0]]
for _ in range(4):
    gear.append(list(map(str,input())))
for _ in range(int(input())):
    n, d = map(int,input().split())
    visited = [False for _ in range(5)]
    chain(n,d)
sum_=0
for i in range(1,5):
    if gear[i][0] == "1":
        sum_ += 2**(i-1)
print(sum_)