17_pushedrumex (#98)

* feat: 코딩테스트 연습 퍼즐 조각 채우기

* 🍊귤 고르기

* 콜라문제

* 블록게임

* (효율성 fail)무지의 먹방 라이브

* (success)무지의 먹방 라이브

* (fail)길 찾기 게임

* (파일 이동)무지의 먹방 라이브

* (파일 이동)무지의 먹방 라이브

* 길찾기 게임

---------

Co-authored-by: bkRyusim <[email protected]>

Author: pushedrumex

Diff for: week-17/pushedrumex/귤 고르기.py

@@ -0,0 +1,15 @@
+from collections import defaultdict
+
+def solution(k, tangerine):
+    dic = defaultdict(int)
+    
+    for t in tangerine:
+        dic[t] += 1
+        
+    answer = 0
+    for t in sorted(dic.keys(), key=lambda t: dic[t], reverse=True):
+        k -= dic[t]
+        answer += 1
+        if k <= 0: break
+        
+    return answer

Diff for: week-17/pushedrumex/길 찾기 게임.py

@@ -0,0 +1,55 @@
+import sys
+sys.setrecursionlimit(10**9)
+
+graph = {}
+nums = {}
+answer = [[], []]
+def solution(nodeinfo):
+    N = len(nodeinfo)
+    for i in range(N):
+        nodeinfo[i] = tuple(nodeinfo[i])
+        
+    for i in range(N):
+        nums[nodeinfo[i]] = i+1
+        graph[nodeinfo[i]] = [None, None]
+        
+    nodeinfo.sort(key=lambda x: -x[1])
+    root = nodeinfo[0]
+    for i in range(1, N):
+        make_tree(root, nodeinfo[i])
+    
+    preorder(root)
+    postorder(root)
+    
+    return answer
+
+def make_tree(parent, child):
+    if child[0] < parent[0]:
+        if graph[parent][0] == None:
+            graph[parent][0] = child
+        else:
+            make_tree(graph[parent][0], child)
+    elif parent[0] < child[0]:
+        if graph[parent][1] == None:
+            graph[parent][1] = child
+        else:
+            make_tree(graph[parent][1], child)
+
+# Root -> L -> R
+def preorder(node):
+    left, right = graph[node]
+    answer[0].append(nums[node])
+    if left != None:
+        preorder(left)
+    if right != None:
+        preorder(right)
+
+# L -> R -> Root
+def postorder(node):
+    left, right = graph[node]
+    if left != None:
+        postorder(left)
+    if right != None:
+        postorder(right)
+
+    answer[1].append(nums[node])

Diff for: week-17/pushedrumex/무지의 먹방 라이브.py

@@ -0,0 +1,32 @@
+# 파이썬 1초에 2000만
+# 이분탐색 O(logN)
+# 200,000 * log(100,000,000) = 5,200,000
+def solution(food_times, k):
+    left, right = 1, int(1e8)
+    N = len(food_times)
+    rotate, t = 0, 0
+    times = sorted(food_times)
+    while left <= right:
+        mid = (left + right) // 2
+        temp = N * mid
+        for time in times:
+            if time >= mid:
+                break
+            temp -= mid - time
+        
+        if temp <= k:
+            rotate = mid
+            t = temp
+            left = mid + 1
+        else:
+            right = mid - 1
+    
+    k -= t
+    for i in range(len(food_times)):
+        food_times[i] -= rotate
+        if food_times[i] > 0:
+            k -= 1
+        if k < 0:
+            return i + 1
+
+    return -1

Diff for: week-17/pushedrumex/블록게임.py

@@ -0,0 +1,57 @@
+# 일단 위쪽에 비어있는 부분들을 검은 블록으로 꽉 채움
+# 꽉착 직사각형이 있는 지 탐색
+# 있다면 제거하고 1번 부터 재시작
+# 없다면 끝
+board = None
+N, M = None, None
+def solution(_board):
+    global board, N, M
+    board = _board
+    
+    N, M = len(board), len(board[0])
+    
+    answer = 0
+    flag = True
+    while flag:
+        flag = False
+        for j in range(M):
+            for i in range(N):
+                if board[i][j] > 0: break
+                board[i][j] = -1 # 검은 블록
+
+        for i in range(N):
+            for j in range(M):
+                if isMatch(i, j, 2, 3):
+                    remove(i, j, 2, 3)
+                    flag = True
+                    answer += 1
+                elif isMatch(i, j, 3, 2):
+                    remove(i, j, 3, 2)
+                    flag = True
+                    answer += 1
+        
+    return answer
+
+def isMatch(x, y, x_size, y_size):
+    num = None
+    block = 0
+    for i in range(x, x+x_size):
+        for j in range(y, y+y_size):
+            if oob(i, j) or board[i][j] == 0: return False
+            if board[i][j] == -1: continue
+            block += 1
+            if num == None:
+                num = board[i][j]
+            elif num != board[i][j]:
+                    return False
+
+    return block == 4
+
+def remove(x, y, x_size, y_size):
+    for i in range(x, x+x_size):
+        for j in range(y, y+y_size):
+            board[i][j] = 0
+
+def oob(x, y):
+    return not (0 <= x < N and 0 <= y < M)
+    

Diff for: week-17/pushedrumex/콜라문제.py

@@ -0,0 +1,8 @@
+def solution(a, b, n):
+    answer = 0
+    while n >= a:
+        cola = n // a * b
+        answer += cola
+        n = n % a + cola
+
+    return answer