Merge pull request #651 from Yujin-Baek/main

[백유진] 97차 라이브 코테 제출

Author: github-actions[bot]

live9/test97/문제1/백유진.py

@@ -0,0 +1,32 @@
+def solution(board, skill):
+    n = len(board)
+    m = len(board[0])
+    
+    acc = [[0] * (m + 1) for _ in range(n + 1)]
+    
+    # skill 명령 누적합 배열에 저장
+    for t, r1, c1, r2, c2, degree in skill:
+        diff = degree if t == 2 else -degree
+        acc[r1][c1] += diff
+        acc[r1][c2 + 1] -= diff
+        acc[r2 + 1][c1] -= diff
+        acc[r2 + 1][c2 + 1] += diff
+    
+    # 가로 누적합
+    for i in range(n):
+        for j in range(1, m):
+            acc[i][j] += acc[i][j - 1]
+    
+    # 세로 누적합
+    for j in range(m):
+        for i in range(1, n):
+            acc[i][j] += acc[i - 1][j]
+    
+    answer = 0
+    for i in range(n):
+        for j in range(m):
+            board[i][j] += acc[i][j]
+            if board[i][j] > 0:
+                answer += 1
+    
+    return answer

live9/test97/문제2/백유진.py

@@ -0,0 +1,16 @@
+def solution(name):
+    answer = 0
+    
+    min_cursor = len(name) - 1
+    
+    for idx, alphabet in enumerate(name):
+        answer += min(ord(alphabet) - 65, 91 - ord(alphabet))
+        
+        end = idx+1
+        while end < len(name) and name[end] == 'A':
+            end += 1
+        min_cursor = min(min_cursor, idx*2 + len(name)-end, (len(name)-end)*2 + idx)
+        
+    answer += min_cursor
+    
+    return answer

live9/test97/문제3/백유진.py

@@ -0,0 +1,24 @@
+def solution(distance, rocks, n):
+    rocks.sort()
+    rocks.append(distance)
+    left, right = 1, distance
+    answer = 0
+
+    while left <= right:
+        mid = (left + right) // 2
+        prev = 0
+        removed = 0
+        
+        for rock in rocks:
+            if rock - prev < mid:
+                removed += 1
+            else:
+                prev = rock
+        
+        if removed > n:
+            right = mid - 1
+        else:
+            answer = mid
+            left = mid + 1
+
+    return answer