takeU

from heapq import heappush, heappop import sys input = sys.stdin.readline n = int(input()) min_h, max_h = [], [] d = {} for _ in range(n): p, l = map(int, input().split()) heappush(min_h, [l, p]) heappush(max_h, [-l, -p]) d[p] = True M = int(input()) for _ in range(M): command = input().split() if command[0] == 'recommend': if command[1] == '1': while not d[-max_h[0][1]]: heappop(max_h) print(-m..

from heapq import heappush, heappop import sys input = sys.stdin.readline n = int(input()) q = sorted([list(map(int, input().split())) for _ in range(n)]) h = [] heappush(h, q[0][1] ) for i in range(1, n): if q[i][0] < h[0]: heappush(h, q[i][1]) else: heappop(h) heappush(h, q[i][1]) print(len(h)) 힙, 그리디

from collections import deque import sys input = sys.stdin.readline def topological_sort(): dp = [0] * (n + 1) q = deque() for i in range(1, n + 1): if indegree[i] == 0: q.append(i) dp[i] = cost[i] while q: cur = q.popleft() for g in graph[cur]: indegree[g] -= 1 dp[g] = max(dp[g], dp[cur] + cost[g]) if indegree[g] == 0: q.append(g) if indegree[last] == 0: print(dp[last]) return t = int(input()) ..

파이썬 그래프, 트리 알고리즘 정리 알고리즘 선택 (최단거리) 가중치가 없는 경우 - BFS 가중치가 있는 경우 음의 가중치가 있을 때 - 벨만-포드 음의 가중치가 없을 때 - 다익스트라 전체 쌍 최단 경로 - 플로이드-워셜 ( n ≤ 100 ) 1. 벨만-포드 (Bellman-Ford Algorithm) 시간 복잡도: O(V * E) 모든 간선을 확인하며 최단 거리를 찾기 때문에 느리다. 음수 간선이 있어도 최단 거리를 찾을 수 있다. import sys input = sys.stdin.readline INF = int(1e9) n, m = map(int, input().split()) edges = [] dist = [INF] * (n + 1) for _ in range(m): u, v, w = ma..

li = list(map(int, input().split()))[:-1] n = len(li) dp = [[[400001] * 5 for _ in range(5)] for _ in range(n + 1)] dp[-1][0][0] = 0 def check(c, n): if c == n: return 1 elif c == 0: return 2 elif n in [c + 1, c - 1, c - 3, c + 3]: return 3 else: return 4 for i in range(n): for j in range(5): for k in range(5): dp[i][li[i]][j] = min(dp[i][li[i]][j], dp[i - 1][k][j] + check(k, li[i])) for j in ra..

import sys input = sys.stdin.readline n = int(input()) li = [list(map(int, input().split())) for _ in range(n)] parent = list(range(n)) def find_parent(parent, x): if parent[x] != x: parent[x] = find_parent(parent, parent[x]) return parent[x] def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: parent[a] = b def ccw(x1, y1, x2, y2, x..

n, m = map(int, input().split()) li = list(map(int, input().split())) dp = [0 for i in range(m)] dp[0] = 1 s = 0 for i in range(n): s += li[i] dp[s % m] += 1 ans = 0 for i in dp: ans += i * (i - 1) // 2 print(ans) dp, 구간 합

li, m = [], [] i = 0 while True: try: line = input().split() li.append(line) for i, l in enumerate(line): if i < len(m): m[i] = max(m[i], len(l)) else: m.append(len(l)) except: break for i, l in enumerate(li): for j, w in enumerate(l): li[i][j] = w + (m[j] - len(w)) * ' ' for l in li: print(' '.join(l).rstrip())

from collections import deque n, k, m = map(int, input().split()) q = deque(range(1, n + 1)) ans = [] i = d = 1 count = 0 while q: if d == 1: cur = q.popleft() if i != k: q.append(cur) else: ans.append(str(cur)) i = 0 count += 1 else: cur = q.pop() if i != k: q.appendleft(cur) else: ans.append(str(cur)) i = 0 count += 1 if count == m: d *= -1 count = 0 i += 1 for a in ans: print(a) 큐, pypy로 제출