takeU

import heapq import sys input = sys.stdin.readline INF = int(1e9) n, e = map(int, input().split()) graph = [[] for _ in range(n + 1)] for _ in range(e): a, b, c = map(int, input().split()) graph[a].append((b, c)) graph[b].append((a, c)) v1, v2 = map(int, input().split()) def dijkstra(start): q = [] distance = [INF] * (n + 1) heapq.heappush(q, (0, start)) distance[start] = 0 while q: dist, now = ..

n = int(input()) dp = [[0, []] for _ in range(n + 1)] for i in range(2, n + 1): dp[i][0] = dp[i - 1][0] + 1 dp[i][1] = dp[i - 1][1] + [i] if i % 3 == 0 and dp[i // 3][0] + 1 < dp[i][0]: dp[i][0] = dp[i // 3][0] + 1 dp[i][1] = dp[i // 3][1] + [i] if i % 2 == 0 and dp[i // 2][0] + 1 < dp[i][0]: dp[i][0] = dp[i // 2][0] + 1 dp[i][1] = dp[i // 2][1] + [i] print(dp[-1][0]) print(*(dp[-1][1][::-1] + [..

v, e = map(int, input().split()) parent = [0] * (v+1) for i in range(1, v+1): parent[i] = i 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 edges = [] total_cost = 0 for _ in range(e): a, b, cost = map(int, in..

from collections import deque n, m = map(int, input().split()) d = {} visited = [0] * 101 visited[1] = 1 q = deque([[1, 0]]) ans = 100 for _ in range(n + m): x, y = map(int, input().split()) d[x] = y while q: cur, count = q.popleft() if cur == 100: ans = min(ans, count) continue for i in range(cur + 1, min(101, cur + 7)): if visited[i] == 0: visited[i] = 1 if i in d: q.append([d[i], count + 1]) ..

from collections import deque n, k = map(int, input().split()) q = deque([[n, 0]]) visited = [0] * 100001 while q: x, c = q.popleft() visited[x] = 1 if x == k: print(c) break if 2 * x = 0 and visited[x - 1] == 0: q.append([x - 1, c + 1]) bfs

import sys input = sys.stdin.readline tc = int(input()) def bellmanford(start): dist[start] = 0 for i in range(n): for s, e, t in edges: if dist[e] > dist[s] + t: dist[e] = dist[s] + t if i == n - 1: return True return False for _ in range(tc): n, m, w = map(int, input().split()) dist = [10000] * (n + 1) edges = [] for _ in range(m): s, e, t = map(int, input().split()) edges.append((s, e, t)) ed..

import heapq import sys input = sys.stdin.readline INF = int(1e9) n, m = int(input()), int(input()) graph = [[] for _ in range(n + 1)] distance = [INF] * (n + 1) path = [[i] for i in range(n + 1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a].append((b, c)) start, end = map(int, input().split()) def dijkstra(start): q = [] heapq.heappush(q, (0, start)) distance[start] = 0 while..

import heapq import sys input = sys.stdin.readline INF = int(1e9) n, m = int(input()), int(input()) graph = [[] for _ in range(n + 1)] distance = [INF] * (n + 1) for _ in range(m): a, b, c = map(int, input().split()) graph[a].append((b, c)) start, end = map(int, input().split()) def dijkstra(start): q = [] heapq.heappush(q, (0, start)) distance[start] = 0 while q: dist, now = heapq.heappop(q) if..

a, b = map(int, input().split()) count = 1 while b > a: if b % 10 == 1: b //= 10 elif b % 2 == 1: break else: b //= 2 count += 1 print(count if b == a else -1) 그리디

n = int(input()) tree = [[] for _ in range(n + 1)] visited = [0] * (n + 1) m = [1, 0] for _ in range(n): cur = list(map(int, input().split())) num, li = cur[0], cur[1:-1] for i in range(0, len(li), 2): tree[num].append([li[i], li[i + 1]]) def dfs(s, d): global m if d > m[1]: m = [s, d] visited[s] = 1 for t in tree[s]: if visited[t[0]] == 0: dfs(t[0], t[1] + d) dfs(1, 0) visited = [0] * (n + 1) d..