[백준 문제풀이] 얼렁뚱당 15686 치킨배달 풀이

 

from itertools import combinations

n, m = map(int,input().split())
house = []
chicken = []
for i in range(n) :
    new_list = list(map(int,input().split()))
    
    for j in range(len(new_list)) :
        if new_list[j] == 1 :
            house.append([i,j])
        elif new_list[j] == 2 :
            chicken.append([i,j])

arr = list(combinations(chicken,m))

real_min = 999999999
for i in range(len(arr)) :
    hou_temp = 0
    for j in range(len(house)) :
        hou_temp += min([abs(house[j][0]-k[0]) + abs(house[j][1]-k[1])  for k in arr[i]])
    if hou_temp < real_min :
        real_min = hou_temp

print(real_min)

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

15686번: 치킨 배달

 음 순서 반대로 됐당 ㅎㅋ