Merge pull request #643 from gmlrude/main

[박희경] 95차 라이브 코테 제출

Author: gmlrude

live9/test95/문제1/박희경.py

@@ -0,0 +1,14 @@
+def solution(k, dungeons):
+    dungeons = [d for d in dungeons if k >= d[0]]
+
+    def calculate_fatigue(dungeons, tmp, cnt):
+        max_cnt = cnt
+        for r, c in dungeons:
+            if r <= tmp:
+                new_dungeons = dungeons[:] # 복사
+                new_dungeons.remove([r, c]) 
+                max_cnt = max(max_cnt, calculate_fatigue(new_dungeons, tmp - c, cnt + 1))
+        return max_cnt
+
+    
+    return calculate_fatigue(dungeons, k, 0)

live9/test95/문제2/박희경.py

@@ -0,0 +1,46 @@
+from collections import *
+        
+        
+
+def solution(n, wires):
+    
+    def create_graph(wires):
+        graph = [[] for _ in range(n + 1)]
+
+        for v1, v2 in wires:
+            graph[v1].append(v2)
+            graph[v2].append(v1)
+        return graph
+        
+    def bfs(graph, x, visited):
+        cnt = 1
+        q = deque([x])
+        visited[x] = 1
+        while q: 
+            x = q.popleft()
+            for nx in graph[x]:
+                if not visited[nx]:
+                    visited[nx] = 1
+                    cnt += 1
+                    q.append(nx)
+        return cnt
+    
+    answer = float('inf')
+    
+    # 모든 간선 하나씩 끊어보기
+    for i in range(len(wires)):
+        tmp = wires[:]
+        del tmp[i]
+        tmp_graph = create_graph(tmp)
+        
+        visited = [0] * (n + 1)
+        count = []
+        
+        for num in range(1, n + 1):
+            if not visited[num]:
+                count.append(bfs(tmp_graph, num, visited))
+        
+        diff = abs(count[0] - count[1])
+        answer = min(answer, diff)
+
+    return answer

live9/test95/문제3/박희경.py

@@ -0,0 +1,26 @@
+# 처음 푼 풀이
+from itertools import *
+
+def solution(brown, yellow):
+    answer = []
+    yellow_list = set()
+    if yellow == 1: yellow_list.add(1)
+    for i in range(1, yellow // 2 + 1):
+        if yellow % i == 0:
+            yellow_list.add(i)
+            yellow_list.add(yellow // i)
+    
+    for x, y in product(yellow_list, repeat=2):
+        if x * y == yellow and x >= y:
+            if x * 2 + y * 2 + 4 == brown:
+                answer.append(x + 2)
+                answer.append(y + 2)
+    
+    return answer
+
+# 다른 풀이 보니 중복 순열을 굳이 쓸 필요 없음
+def solution(brown, yellow):
+ for i in range(1, int(yellow ** 0.5) + 1):
+        if yellow % i == 0:
+            if (i + yellow // i) * 2 == brown - 4:
+                return [yellow // i + 2, i + 2]