2025-09-06

Author: Seol-Munhyeok

Seol-Munhyeok/.cph/.개똥벌레.py_478b34ffa2be96fa5b5b2fbb1687d64c.prob

@@ -0,0 +1 @@
+{"name":"Local: 개똥벌레","url":"d:\\AlgoLeadME-15\\AlgoLeadMe-15\\Seol-Munhyeok\\개똥벌레.py","tests":[{"id":1756972182171,"input":"14 5\n1\n3\n4\n2\n2\n4\n3\n4\n3\n3\n3\n2\n3\n3","output":"7 2"},{"id":1756972205164,"input":"6 7\n1\n5\n3\n3\n5\n1","output":"2 3"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"d:\\AlgoLeadME-15\\AlgoLeadMe-15\\Seol-Munhyeok\\개똥벌레.py","group":"local","local":true}

Seol-Munhyeok/.cph/.개똥벌레2.py_f7b1bfedf84554024f689b69b61e08ce.prob

@@ -0,0 +1 @@
+{"name":"Local: 개똥벌레2","url":"d:\\AlgoLeadME-15\\AlgoLeadMe-15\\Seol-Munhyeok\\개똥벌레2.py","tests":[{"id":1756973855147,"input":"14 5\n1\n3\n4\n2\n2\n4\n3\n4\n3\n3\n3\n2\n3\n3","output":"7 2"},{"id":1756974701757,"input":"6 7\n1\n5\n3\n3\n5\n1","output":"2 3"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"d:\\AlgoLeadME-15\\AlgoLeadMe-15\\Seol-Munhyeok\\개똥벌레2.py","group":"local","local":true}

Seol-Munhyeok/.cph/.차량배치.py_1ee6dc7200a143d3ff95e315a3e7cb91.prob

@@ -0,0 +1 @@
+{"name":"Local: 차량배치","url":"d:\\AlgoLeadME-15\\AlgoLeadMe-15\\Seol-Munhyeok\\차량배치.py","tests":[{"id":1756981134725,"input":"3 3\n1 2\n1 3\n2 3","output":"5"},{"id":1756981248426,"input":"3 2\n1 2\n2 3","output":"7"},{"id":1756981481893,"input":"6 5\n1 2\n1 3\n2 4\n2 5\n3 6","output":"23"},{"id":1756981635073,"input":"1 0\n","output":"1"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"d:\\AlgoLeadME-15\\AlgoLeadMe-15\\Seol-Munhyeok\\차량배치.py","group":"local","local":true}

Seol-Munhyeok/개똥벌레.py

@@ -1,10 +1,28 @@
+from bisect import bisect_left
+
 # 입력 처리
-n, h = map(int, input().split())
+N, H = map(int, input().split())
 down, up = [], []
-for i in range(n):
-    num = int(input())
+for i in range(N):
+    h = int(input())
     if i % 2 == 0:
-        down.append(num)
+        down.append(h)
     else:
-        up.append(num)
+        up.append(h)
+
+down.sort()
+up.sort()
 
+best = int(1e9)  # 파괴해야 하는 장애물의 최솟값
+way = 1  # 구간의 수
+for h in range(1, H + 1):
+    cnt_down = N // 2 - bisect_left(down, h)
+    cnt_up = N // 2 - bisect_left(up, H - h + 1)
+    cnt = cnt_down + cnt_up
+    if best > cnt:
+        best = cnt
+        way = 1
+    elif best == cnt:
+        way += 1
+        
+print(best, way)

Seol-Munhyeok/개똥벌레2.py

@@ -0,0 +1,28 @@
+import sys
+input = sys.stdin.readline
+
+N, H = map(int, input().split())
+
+# line[i] = 높이 i에서 시작되는 충돌 변화량
+line = [0] * H
+
+for t in range(N):
+    h = int(input())
+    if t % 2 == 0:  # 석순(아래에서 위로 올라옴)
+        line[0] += 1
+        line[h] -= 1
+    else:  # 종유석(위에서 아래로 내려옴)
+        line[H - h] += 1
+
+# prefix[y] = 높이 y에서 총 충돌 개수
+prefix = [0] * (H + 1)
+for i in range(H):
+    prefix[i + 1] = prefix[i] + line[i]
+
+prefix = prefix[1:]
+
+print(line)
+print(prefix)
+best = min(prefix)
+way = prefix.count(best)
+print(best, way)

Seol-Munhyeok/방금그곡.py

@@ -0,0 +1,32 @@
+def time_to_sec(time):
+    h, m = time.split(":")
+    return 60 * int(h) + int(m)
+
+def convert(score):
+    lst = [("B#", "b"), ("C#", "c"), ("D#", "d"), ("E#", "e"), ("F#", "f"), ("G#", "g"), ("A#", "a")]
+    for a, b in lst:
+        score = score.replace(a, b)        
+    return score
+
+def convert_2(score, length):    
+    size = len(score)
+    if size == length:
+        return score
+    if size > length:
+        return score[:length]
+    if size < length:
+        return score * (length // size) + score[:length % size]
+
+
+def solution(m, musicinfos):
+    answer = '(None)'
+    max_size = -1
+    for info in musicinfos:
+        start, end, title, score = info.split(",")
+        length = time_to_sec(end) - time_to_sec(start)
+        m, score = convert(m), convert(score)
+        if m in convert_2(score, length) and length > max_size:
+            answer = title
+            max_size = length
+            
+    return answer

Seol-Munhyeok/차량배치.py

@@ -0,0 +1,28 @@
+from collections import defaultdict, deque
+import sys
+
+input = sys.stdin.readline
+N, M = map(int, input().split())
+graph = defaultdict(list)
+for _ in range(M):
+    a, b = map(int, input().split())
+    graph[a].append(b)
+    graph[b].append(a)
+
+visited = [False] * (N+1)
+queue = deque()
+queue.append(1)
+visited[1] = True
+answer = 1
+
+while queue:
+    size = len(queue)
+    answer *= (size + 1)
+    for _ in range(size):
+        cur = queue.popleft()
+        for neighbor in graph[cur]:
+            if not visited[neighbor]:
+                queue.append(neighbor)
+                visited[neighbor] = True
+
+print((answer - 1) % 1_000_000_007)