takeU

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..

import sys input = sys.stdin.readline from collections import deque t = int(input()) for _ in range(t): n, m = map(int, input().split()) visited = [0] * 10001 q = deque([[n, '']]) while q: cur, s = q.popleft() if cur == m: print(s) break if visited[cur] == 0: q.append([cur * 2 % 10000, s + 'D']) q.append([cur - 1 if cur > 0 else 9999, s + 'S']) q.append([cur % 1000 * 10 +..

INF = int(1e9) n, m = map(int, input().split()) graph = [[INF] * (n + 1) for _ in range(n + 1)] for a in range(1, n + 1): for b in range(1, n + 1): if a == b: graph[a][b] = 0 for _ in range(m): a, b = map(int, input().split()) graph[a][b] = graph[b][a] = 1 for k in range(1, n + 1): for a in range(1, n + 1): for b in range(1, n + 1): cur = min(graph[a][b], graph[a][k] + graph[k][b]) graph[a][b] =..

n = int(input()) li = [False] * 2 + [True] * (n - 1) left, right = 2, 2 acc = left ans = 0 for i in range(2, n + 1): for j in range(2 * i, n + 1, i): if li[j]: li[j] = False def find_next(num): while num < n: num += 1 if li[num]: return num return False while left

n, m = map(int, input().split()) li = list(map(int, input().split())) left, right = 0, 0 acc = li[left] ans = n flag = 0 while left = m: flag = 1 ans = min(ans, right - left + 1) acc -= li[left] left += 1 else: right += 1 if right < n: acc += li[right] print(ans if flag else 0) 투포인터

n = int(input()) li = sorted(list(map(int, input().split()))) left, right = 0, n - 1 prev = [li[0] + li[n - 1], [li[0], li[n - 1]]] while left < right: cur = li[left] + li[right] if cur == 0: prev[1] = [li[left], li[right]] break if abs(cur) < abs(prev[0]): prev = [cur, [li[left], li[right]]] if cur < 0: left += 1 else: right -= 1 print(*prev[1]) 투포인터

import sys input = sys.stdin.readline n, k = map(int, input().split()) student = [0] * n num = [0] * 21 count = 0 for i in range(n): student[i] = len(input().strip()) if i > k: num[student[i - k - 1]] -= 1 count += num[student[i]] num[student[i]] += 1 print(count) 슬라이딩 윈도우

t = int(input()) for _ in range(t): n = int(input()) li = [list(map(int, input(). split())) for _ in range(2)] if n == 1: print(max(li[0][0], li[1][0])) else: dp = [[li[0][0], li[1][0]], [li[1][0] + li[0][1], li[0][0] + li[1][1]]] for i in range(2, n): a = max(max(dp[i - 2][0], dp[i - 2][1]) + li[0][i], dp[i - 1][1] + li[0][i]) b = max(max(dp[i - 2][0], dp[i - 2][1]) + li[1][i], dp[i - 1][0] + l..