takeU

import sys sys.setrecursionlimit(10 ** 8) input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [[-1, 0] for _ in range(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 graph[node].sort(reverse=True) for g in graph[node]: if visited[g][0] == -1: count += 1 ..

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

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

from collections import deque import sys input = sys.stdin.readline n, m, r = map(int, input().split()) graph = [[] for _ in range(n + 1)] visited = [[-1, 0] for _ in range(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][0] = 0 while q: v = q.popleft() graph[v].sort(reverse=True) for g ..

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

import sys input = sys.stdin.readline m, n = map(int, input().split()) d = {} for _ in range(m): li = list(map(int, input().split())) k = sorted(list(set(li))) i = {k[i]: i for i in range(len(k))} c = str([i[l] for l in li]) d[c] = d.get(c, 0) + 1 print(sum(map(lambda x: x * (x - 1) // 2, d.values()))) 좌표압축

s = input() for i in range(len(s) - 1): if s[i] > s[i + 1] and s[i + 1] = s[i + 1]: s = s[:i + 2][::-1] + s[i + 2:] print(s) 문자열

import sys input = sys.stdin.readline def find_parent(parent, x): if parent[x] != x: return find_parent(parent, parent[x]) return x def union_parent(parent, a, b, c): a = find_parent(parent, a) b = find_parent(parent, b) if a != b: parent[max(a, b)] = min(a, b) else: return c return 0 n, m = map(int, input().split()) parents = list(range(n)) ans = 0 for i in range(1, m + 1): x, y = map(int, inpu..

per = input() n = (len(per) - 9) // 2 + 9 if len(per) > 9 else len(per) check = [0] * (n + 1) ans = [] def bt(p): if sum(check) == n: print(*ans) exit() if len(p) >= 2: cur = int(p[:2]) if cur

import sys input = sys.stdin.readline n = int(input()) stack, ans = [], 0 for _ in range(n): x, y = map(int, input().split()) while stack and stack[-1] > y: ans += 1 stack.pop() if stack and stack[-1] == y: continue stack.append(y) while stack: if stack[-1] > 0: ans += 1 stack.pop() print(ans) 스택