[백준 알고리즘] 2251번 물통. 파이썬(python)/ dfs, bfs

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

2251번: 물통

import sys
from collections import deque
input=sys.stdin.readline

a,b,c=map(int, input().split())

# 경우의 수 담을 큐
q=deque()
q.append((0,0))

visit=[[0]*(b+1) for _ in range(a+1)]
visit[0][0]=1

answer=[]

def pour(x,y):
    if visit[x][y]==0:
        visit[x][y]=1
        q.append((x,y))

def bfs():
    while q:
        x,y=q.popleft()
        z=c-x-y

        if x==0: # A물통이 비어있는 경우 C무롱에 남은 양 저장
            answer.append(z)
        
        # A->B
        water=min(x,b-y)
        pour(x-water, y+water)
        # A->C
        water=min(x,c-z)
        pour(x-water, y)

        # B->A
        water=min(y,a-x)
        pour(x+water, y-water)
        # B->C
        water=min(y,c-z)
        pour(x, y-water)

        # C->A
        water=min(z,a-x)
        pour(x+water, y)
        # C->B
        water=min(z,b-y)
        pour(x, y+water)

bfs()
answer.sort()
print(*answer)