[오늘의 알고리즘] 등대 (#45)

Co-authored-by: unknown <Administrator@SKCC20N00129.SKCC.NET>

Author: yongjun-0903

yongjun-0903/등대.py

@@ -0,0 +1,48 @@
+"""
+n이 100,000인 것부터 복잡도 고려해야 할 것 같고
+최소 등대의 개수니까 BFS?
+"""
+from collections import deque
+
+def solution(n, lighthouse):
+    graph = {}
+    for i, j in lighthouse:
+        if i not in graph:
+            graph[i] = []
+        graph[i].append(j)
+        
+        if j not in graph:
+            graph[j] = []
+        graph[j].append(i)
+    print(graph)
+    print(graph[1])
+    
+    node_counts = [(key, len(value)) for key, value in graph.items()]
+    node_counts.sort(key=lambda x: x[1], reverse=True)
+    heap = deque(node_counts)
+    print(heap)
+    answer = [False] * n
+    print(heap.popleft()[0])
+    while all(answer) == True:
+        while heap:
+            index, surround = heap.popleft()[0], heap.popleft()[1]
+            answer[index] = True
+            answer = [True for x in answer if x in surround]
+            
+    # answer = 0
+    # edge_count = [0] * (n + 1)
+    # # print(edge_count)
+    # for house in lighthouse:
+    #     for i in range(1, n+1):
+    #         if i in house:
+    #             edge_count[i] += 1
+    # print(edge_count)
+    # # print(edge_count.index(max(edge_count)))
+    # safe = [False] * n
+    # # print(safe)
+    # safe[edge_count.index(max(edge_count))] = True
+    # answer = 1
+    # # 이제 여기서 max가 있는 index를 찾아 걔의 불을 켜주면 걔 주위는 다 상관없음
+    # # 이런 식으로 max를 계속 키면서 모든 뱃길이 안전할 때까지 반복
+    # while all(safe) == True:
+