Merge pull request #253 from AlgoLeadMe/33-H0ngJu

33-H0ngJu
AlgoLeadMe · Nov 19, 2024 · 3a46632 · 3a46632
2 parents 455c6da + 7f800c4
commit 3a46632
Show file tree

Hide file tree

Showing 2 changed files with 146 additions and 33 deletions.
diff --git a/H0ngJu/README.md b/H0ngJu/README.md
@@ -1,36 +1,37 @@
 ## ✏️ 기록
 
-|  차시  |    날짜    | 문제유형  |                                         링크                                          |                        풀이                         |
-| :----: | :--------: | :-------: | :-----------------------------------------------------------------------------------: | :-------------------------------------------------: |
-| 1차시  | 2024.03.05 |    큐     |      [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587)      | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/151 |
-| 2차시  | 2024.03.07 |    큐     | [다리를 지나는 트럭](https://school.programmers.co.kr/learn/courses/30/lessons/42583) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/153 |
-| 3차시  | 2024.03.10 |    힙     |                  [N번째 큰 수](https://www.acmicpc.net/problem/2075)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/156 |
-| 4차시  | 2024.03.13 |    힙     |                    [문제집](https://www.acmicpc.net/problem/1766)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/158 |
-| 5차시  | 2024.03.16 |   구현    |                 [요세푸스 문제](https://www.acmicpc.net/problem/1158)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/161 |
-| 6차시  | 2024.03.19 |   스택    |                    [오큰수](https://www.acmicpc.net/problem/17298)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/164 |
-| 7차시  | 2024.03.22 |    DP     |                 [1,2,3 더하기](https://www.acmicpc.net/problem/9095)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/166 |
-| 8차시  | 2024.03.16 |    DP     |                 [쉬운 계단 수](https://www.acmicpc.net/problem/10844)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/170 |
-| 9차시  | 2024.03.22 |    DP     |                  [RGB거리 2](https://www.acmicpc.net/problem/17404)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/172 |
-| 10차시 | 2024.04.03 |    BFS    |                  [숨바꼭질 4](https://www.acmicpc.net/problem/13913)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/177 |
-| 11차시 | 2024.04.07 |   구현    |                   [사탕 게임](https://www.acmicpc.net/problem/9095)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/178 |
-| 12차시 | 2024.04.09 |    DFS    |                    [ABCDE](https://www.acmicpc.net/problem/13023)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/180 |
-| 13차시 | 2024.05.06 | 완전탐색  |                    [리모컨](https://www.acmicpc.net/problem/1107)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/181 |
-| 14차시 | 2024.05.09 |    DFS    |                   [치킨배달](https://www.acmicpc.net/problem/15686)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/183 |
-| 15차시 | 2024.05.14 |  그리디   |                    [A와 B](https://www.acmicpc.net/problem/12904)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/188 |
-| 16차시 | 2024.05.14 |    BFS    |               [뱀과 사다리 게임](https://www.acmicpc.net/problem/16928)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/191 |
-| 17차시 | 2024.05.22 |    BFS    |                   [적록색약](https://www.acmicpc.net/problem/10026)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/195 |
-| 18차시 | 2024.05.26 |    DFS    |              [계란으로 계란치기](https://www.acmicpc.net/problem/16987)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/199 |
-| 19차시 | 2024.05.31 |    DP     |                    [합분해](https://www.acmicpc.net/problem/2225)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/202 |
-| 20차시 | 2024.06.03 | 백트래킹  |                [스타트와 링크](https://www.acmicpc.net/problem/14889)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/206 |
-| 21차시 | 2024.06.07 |  그리디   |                 [행복 유치원](https://www.acmicpc.net/problem/13164)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/208 |
-| 22차시 | 2024.08.06 |   해시    |        [의상](https://school.programmers.co.kr/learn/courses/30/lessons/42578)        | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/224 |
-| 23차시 | 2024.08.10 |   해시    |     [베스트앨범](https://school.programmers.co.kr/learn/courses/30/lessons/42579)     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/227 |
-| 24차시 | 2024.08.17 |    BFS    |                   [아기상어](https://www.acmicpc.net/problem/16236)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/233 |
-| 25차시 | 2024.08.17 |    DFS    |                    [친구비](https://www.acmicpc.net/problem/16562)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/234 |
-| 26차시 | 2024.08.24 |  그리디   |                   [신입사원](https://www.acmicpc.net/problem/1946)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/237 |
-| 27차시 | 2024.08.27 |    DFS    |                  [트리의 지름](https://www.acmicpc.net/problem/1967)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/240 |
-| 28차시 | 2024.09.04 | 벨만포드  |                   [타임머신](https://www.acmicpc.net/problem/11657)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/244 |
-| 29차시 | 2024.09.06 |   구현    |                   [톱니바퀴](https://www.acmicpc.net/problem/14891)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/245 |
-| 30차시 | 2024.09.27 |   수학    |         [Fly me to the Alpha Centauri](https://www.acmicpc.net/problem/1011)          | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/248 |
-| 31차시 | 2024.10.05 |   정렬    |                    [선 긋기](https://www.acmicpc.net/problem/2170)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/249 |
+|  차시  |    날짜    | 문제유형 |                                         링크                                          |                        풀이                         |
+| :----: | :--------: | :------: | :-----------------------------------------------------------------------------------: | :-------------------------------------------------: |
+| 1차시  | 2024.03.05 |    큐    |      [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587)      | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/151 |
+| 2차시  | 2024.03.07 |    큐    | [다리를 지나는 트럭](https://school.programmers.co.kr/learn/courses/30/lessons/42583) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/153 |
+| 3차시  | 2024.03.10 |    힙    |                  [N번째 큰 수](https://www.acmicpc.net/problem/2075)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/156 |
+| 4차시  | 2024.03.13 |    힙    |                    [문제집](https://www.acmicpc.net/problem/1766)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/158 |
+| 5차시  | 2024.03.16 |   구현   |                 [요세푸스 문제](https://www.acmicpc.net/problem/1158)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/161 |
+| 6차시  | 2024.03.19 |   스택   |                    [오큰수](https://www.acmicpc.net/problem/17298)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/164 |
+| 7차시  | 2024.03.22 |    DP    |                 [1,2,3 더하기](https://www.acmicpc.net/problem/9095)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/166 |
+| 8차시  | 2024.03.16 |    DP    |                 [쉬운 계단 수](https://www.acmicpc.net/problem/10844)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/170 |
+| 9차시  | 2024.03.22 |    DP    |                  [RGB거리 2](https://www.acmicpc.net/problem/17404)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/172 |
+| 10차시 | 2024.04.03 |   BFS    |                  [숨바꼭질 4](https://www.acmicpc.net/problem/13913)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/177 |
+| 11차시 | 2024.04.07 |   구현   |                   [사탕 게임](https://www.acmicpc.net/problem/9095)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/178 |
+| 12차시 | 2024.04.09 |   DFS    |                    [ABCDE](https://www.acmicpc.net/problem/13023)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/180 |
+| 13차시 | 2024.05.06 | 완전탐색 |                    [리모컨](https://www.acmicpc.net/problem/1107)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/181 |
+| 14차시 | 2024.05.09 |   DFS    |                   [치킨배달](https://www.acmicpc.net/problem/15686)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/183 |
+| 15차시 | 2024.05.14 |  그리디  |                    [A와 B](https://www.acmicpc.net/problem/12904)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/188 |
+| 16차시 | 2024.05.14 |   BFS    |               [뱀과 사다리 게임](https://www.acmicpc.net/problem/16928)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/191 |
+| 17차시 | 2024.05.22 |   BFS    |                   [적록색약](https://www.acmicpc.net/problem/10026)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/195 |
+| 18차시 | 2024.05.26 |   DFS    |              [계란으로 계란치기](https://www.acmicpc.net/problem/16987)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/199 |
+| 19차시 | 2024.05.31 |    DP    |                    [합분해](https://www.acmicpc.net/problem/2225)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/202 |
+| 20차시 | 2024.06.03 | 백트래킹 |                [스타트와 링크](https://www.acmicpc.net/problem/14889)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/206 |
+| 21차시 | 2024.06.07 |  그리디  |                 [행복 유치원](https://www.acmicpc.net/problem/13164)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/208 |
+| 22차시 | 2024.08.06 |   해시   |        [의상](https://school.programmers.co.kr/learn/courses/30/lessons/42578)        | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/224 |
+| 23차시 | 2024.08.10 |   해시   |     [베스트앨범](https://school.programmers.co.kr/learn/courses/30/lessons/42579)     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/227 |
+| 24차시 | 2024.08.17 |   BFS    |                   [아기상어](https://www.acmicpc.net/problem/16236)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/233 |
+| 25차시 | 2024.08.17 |   DFS    |                    [친구비](https://www.acmicpc.net/problem/16562)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/234 |
+| 26차시 | 2024.08.24 |  그리디  |                   [신입사원](https://www.acmicpc.net/problem/1946)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/237 |
+| 27차시 | 2024.08.27 |   DFS    |                  [트리의 지름](https://www.acmicpc.net/problem/1967)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/240 |
+| 28차시 | 2024.09.04 | 벨만포드 |                   [타임머신](https://www.acmicpc.net/problem/11657)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/244 |
+| 29차시 | 2024.09.06 |   구현   |                   [톱니바퀴](https://www.acmicpc.net/problem/14891)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/245 |
+| 30차시 | 2024.09.27 |   수학   |         [Fly me to the Alpha Centauri](https://www.acmicpc.net/problem/1011)          | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/248 |
+| 31차시 | 2024.10.05 |   정렬   |                    [선 긋기](https://www.acmicpc.net/problem/2170)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/249 |
 | 32차시 | 2024.10.14 | 이분 탐색 |                   [기타 레슨](https://www.acmicpc.net/problem/2343)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/252 |
+| 33차시 | 2024.11.08 | 백트래킹 | [병원 거리 최소화](https://www.codetree.ai/training-field/frequent-problems/problems/min-of-hospital-distance/submissions?page=11&pageSize=5) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/253 |
diff --git a/H0ngJu/백트래킹/병원 거리 최소화.py b/H0ngJu/백트래킹/병원 거리 최소화.py
@@ -0,0 +1,112 @@
+import sys
+
+def input() : return sys.stdin.readline().rstrip()
+
+n, m = map(int, input().split())
+hospital = []
+person = []
+info = [[] for _ in range(n)]
+
+# 사람, 병원 정보 받기
+for i in range(n):
+    info[i].extend(list(map(int, input().split())))
+    for j in range(n):
+        if info[i][j] == 2:
+            hospital.append((i,j))
+        if info[i][j] == 1:
+            person.append((i,j))
+
+distance = [[0 for _ in range(len(hospital))] for _ in range(len(person))]
+
+for i in range(len(person)):
+    px, py = person[i]
+    for j in range(len(hospital)):
+        hx, hy = hospital[j]
+        distance[i][j] = abs(px-hx) + abs(py-hy)
+
+# hospital 위치 중에 m개를 선택해서 최솟값 구하기
+hospital_arr = [i for i in range(len(hospital))]
+all_combinations = []
+
+def combination(start, depth, combination_arr):
+    if depth == m: # m만큼 찾으면 return
+        all_combinations.append(combination_arr[:])
+        return
+    for i in range(start, len(hospital_arr)):
+        combination_arr.append(hospital_arr[i]) # 원소 일단 넣고
+        combination(i + 1, depth + 1, combination_arr) # 재귀 돌림
+        combination_arr.pop() # 다시 뽑은거 복귀 -> [1,2,3]을 구하면, 3빼고 다시 다음 반복문 넣어서 [1,2,4] 가능
+
+combination(0, 0, [])
+
+min_distance_sum = 1e9
+for hospitals_combination in all_combinations:
+    cur_distance = 0
+
+    for i in range(len(person)):
+        dist = 1e9
+        for j in hospitals_combination:
+            dist = min(dist, distance[i][j])
+        cur_distance += dist
+
+    min_distance_sum = min(min_distance_sum, cur_distance)
+
+print(min_distance_sum)
+
+# --- combination -----
+
+# import sys
+# import itertools
+
+# def input() : return sys.stdin.readline().rstrip()
+
+# n, m = map(int, input().split())
+# hospital = []
+# person = []
+# info = [[] for _ in range(n)]
+
+# # 사람, 병원 정보 받기
+# for i in range(n):
+#     info[i].extend(list(map(int, input().split())))
+#     for j in range(n):
+#         if info[i][j] == 2:
+#             hospital.append((i,j))
+#         if info[i][j] == 1:
+#             person.append((i,j))
+
+# distance = [[0 for _ in range(len(hospital))] for _ in range(len(person))]
+
+# for i in range(len(person)):
+#     px, py = person[i]
+#     for j in range(len(hospital)):
+#         hx, hy = hospital[j]
+#         distance[i][j] = abs(px-hx) + abs(py-hy)
+
+# # hospital 위치 중에 m개를 선택해서 최솟값 구하기
+
+# min_distance_sum = 1e9
+# combbination_arr = [i for i in range(len(hospital))]
+
+# for hospitals_combination in itertools.combinations(combbination_arr, m):
+#     cur_distance = 0
+
+#     for i in range(len(person)):
+#         dist = 1e9
+#         for j in hospitals_combination:
+#             dist = min(dist, distance[i][j])
+#         cur_distance += dist
+
+#     min_distance_sum = min(min_distance_sum, cur_distance)
+
+# print(min_distance_sum)
+
+# # 빈자리면 0, 사람이면 1, 병원이면 2
+# # 출력은 최소 거리
+
+# # 병원의 수 만큼 배열을 생성해서, 각 사람마다의 최소 거리를 계산한다.
+# # 각 병원의 거리 총 합을 계산해서 정렬한다. -> 문제 : 사람마다 다른 병원이 최소 거리일 수 있지만, 해당 가능성을 무시하게 됨
+
+# # 각 사람마다 각 병원의 거리를 계산한다.
+# # [[1,2,4,5], [1,2,4,5]]의 형태
+# # 병원 중 m개를 고르는 조합
+# # 조합에서 최소거리 갱신하여 찾기