takeU

import sys input = sys.stdin.readline n, m = map(int, input().split()) s = list(range(n + 1)) def find_parent(parent, x): if parent[x] != x: return find_parent(parent, parent[x]) return x def find_num(parent, x, y): if x == y or find_parent(parent, x) == find_parent(parent, y): print("YES") else: print("NO") def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if..

import sys input = sys.stdin.readline n, m = map(int, input().split()) INF = int(1e9) graph = [[INF] * (n + 1) for _ in range(n + 1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a][b] = c for k in range(1, n + 1): for a in range(1, n + 1): for b in range(1, n + 1): graph[a][b] = min(graph[a][b], graph[a][k] + graph[k][b]) ans = INF for i in range(1, n + 1): ans = min(ans, graph[..

import sys input = sys.stdin.readline INF = int(1e9) n, m = map(int, input().split()) edges = [] dist = [INF] * (n + 1) for _ in range(m): a, b, c = map(int, input().split()) edges.append((a, b, c)) def bf(start): dist[start] = 0 for i in range(n): for j in range(m): node, next_node, cost = edges[j] if dist[node] != INF and dist[next_node] > dist[node] + cost: dist[next_node] = dist[node] + cost..

from collections import deque import sys input = sys.stdin.readline k = int(input()) def bfs(node): q = deque([node]) visited[node] = 1 while q: cur = q.popleft() for g in graph[cur]: if not visited[g]: visited[g] = -visited[cur] q.append(g) elif visited[g] == visited[cur]: return False return True for _ in range(k): v, e = map(int, input().split()) graph = [[] for _ in range(v + 1)] visited = [..

n, k = map(int, input().split()) li = list(map(int, input().split())) count = 0 for i in range(n - 1, 0, -1): idx = li.index(max(li[:i + 1])) if idx != i: li[idx], li[i] = li[i], li[idx] count += 1 if count == k: print(*li) exit() print(-1) 선택 정렬

n, k = map(int, input().split()) li = list(map(int, input().split())) count = 0 for i in range(n - 1, 0, -1): idx = li.index(max(li[:i + 1])) if idx != i: li[idx], li[i] = li[i], li[idx] count += 1 if count == k: print(li[idx], li[i]) exit() print(-1) 선택정렬

from collections import deque import sys input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) count = 1 for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) def bfs(v): global count q = deque([r]) visited[r] = 1 while q: v = q.popleft() graph[v].sort(reverse=True) for g in graph[v]: if visit..

from collections import deque import sys input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) count = 1 for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) def bfs(v): global count q = deque([r]) visited[r] = 1 while q: v = q.popleft() graph[v].sort() for g in graph[v]: if visited[g] == 0: ..

import sys sys.setrecursionlimit(10 ** 8) input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) ans = [0] * (n + 1) count = 1 for _ in range(m): x, y = map(int, input().split()) graph[x].append(y) graph[y].append(x) def dfs(node): global count visited[node] = 1 ans[node] = count graph[node].sort(reverse=True) for g in graph[node..

import sys sys.setrecursionlimit(10**9) input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [0] * (n + 1) count = 1 for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) def dfs(v): global count visited[v] = count graph[v].sort() for g in graph[v]: if visited[g] == 0: count += 1 dfs(g) dfs(r) for i in ran..