Merge pull request #195 from AlgoLeadMe/41-gjsk132

41-gjsk132

gjsk132/README.md

@@ -40,3 +40,4 @@
 | 38차시 | 2024.05.24 | BFS | [17836 공주님을 구해라!](https://www.acmicpc.net/problem/17836) | [👸](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/180) |
 | 39차시 | 2024.05.29 | Dijkstra | [11781 퇴근 시간](https://www.acmicpc.net/problem/11781) | [🚌](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/183) |
 | 40차시 | 2024.06.04 | BitMasking | [[1차] 비밀지도](https://school.programmers.co.kr/learn/courses/30/lessons/17681) | [🗺️](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/190) |
+| 41차시 | 2024.07.01 | TSP | [2098 외판원 순회](https://www.acmicpc.net/problem/2098) | [✈️](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/195) |

gjsk132/TSP/2098 외판원 순회.py

@@ -0,0 +1,31 @@
+input = open(0).readline
+
+N = int(input())
+
+cost = [list(map(int, input().split())) for _ in range(N)]
+
+INF = float('inf')
+dp = [[0]*((1 << N) - 1) for _ in range(N)]
+
+def DFS(now, visited):
+    if visited == (1<<N)-1:
+        if cost[now][0]:        
+            return cost[now][0]
+        else:
+            return INF
+
+    if dp[now][visited] != 0:
+        return dp[now][visited]
+
+    dp[now][visited] = INF
+
+    for i in range(1, N):
+        if cost[now][i] == 0:
+            continue
+        if visited & (1<<i):
+            continue
+        dp[now][visited] = min(dp[now][visited], cost[now][i]+DFS(i,visited | (1<<i)))
+
+    return dp[now][visited]
+
+print(DFS(0,1))