풀캠정글러

import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) n = int(input()) C = list(input()) del C[-1] out = [] for i in range(n) : C[i] = int(C[i]) if C[i] == 0 : out.append(i+1) count = 0 V = [[] for i in range(n + 1)] for i in range(n - 1) : v1, v2 = map(int, input().split()) if C[v1 - 1] + C[v2 - 1] == 2 : count = count + 2 else : V[v1].append(v2) V[v2].append(v1) sum = sum(C) if su..

import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) n = int(input()) parent = [0 for i in range(n + 1)] V = {} for i in range(1, n + 1) : V[i] = [] for i in range(n-1) : v1, v2 = map(int, input().split()) V[v1].append(v2) V[v2].append(v1) def DFS(p) : for i in V[p] : if parent[i] == 0 : parent[i] = p DFS(i) DFS(1) for i in range(2, n + 1) : print(parent[i]) v1과 v2가 연결되어있다는건 인풋으로 알..

import sys input = sys.stdin.readline C = [] n, k = map(int, input().split()) for i in range(n) : C.append(int(input())) count = [0 for i in range(k + 1)] for now in range(1, k + 1) : before = [] for coin in C : if coin

import sys input = sys.stdin.readline from collections import deque r, c = map(int, input().split()) T = [] que = deque() for i in range(r) : T.append(list(input())) for j in range(c) : if T[i][j] == '*' : que.append([i, j, 0, '*']) for i in range(r) : for j in range(c) : if T[i][j] == 'S' : que.append([i, j, 0, 'S']) dx = [1, -1, 0, 0] dy = [0, 0, 1, -1] done = False while que : a, b, t, f = qu..

import sys input = sys.stdin.readline from collections import deque n, m, h = map(int, input().split()) B = [] que = deque() check = [[[False for i in range(n)] for j in range(m)] for k in range(h)] for k in range(h) : B.append([]) for j in range(m) : B[k].append(list(map(int, input().split()))) for i in range(n) : t = B[k][j][i] if t == 1 : que.append([i, j, k]) dx = [1, -1, 0, 0, 0, 0] dy = [0..

import sys input = sys.stdin.readline import heapq V = [] n= int(input()) for i in range(n) : V.append(list(input())) def cost(x) : if x == '1' : return 0 if x == '0' : return 1 maxc = 2 * n D = {} for i in range(n) : for j in range(n) : D[(i, j)] = maxc dx = [1, -1, 0, 0] dy = [0, 0, 1, -1] def DIJK(start) : D[start] = 0 heap = [[0, start]] while heap : c, q = heapq.heappop(heap) if c = n or y ..

import sys input = sys.stdin.readline import heapq Vn = int(input()) En = int(input()) V = {} for i in range(1, Vn + 1) : V[i] = [] for i in range(En) : v1, v2, c = map(int, input().split()) V[v1].append([v2, c]) start, end = map(int, input().split()) maxc = 100000000 D = [maxc for i in range(Vn + 1)] def DIJK(start) : D[start] = 0 heap = [[0, start]] while heap : c, q = heapq.heappop(heap) if c

import sys input = sys.stdin.readline Vn, En, k, x = map(int, input().split()) V = {} for i in range(1, Vn + 1) : V[i] = [] for i in range(En) : v1, v2 = map(int, input().split()) V[v1].append(v2) gone = [False for i in range(Vn+1)] ans = [] def BFS(now) : que = [[now, 0]] while que : q, d = que[0][0], que[0][1] del que[0] if d == k : ans.append(q) else : for i in V[q] : if not gone[i] : gone[i]..

import sys input = sys.stdin.readline n, m = map(int, input().split()) T = [] for i in range(n) : T.append(list(input())) T.append([None for i in range(m+1)]) dx = [1, -1, 0, 0] dy = [0, 0, 1, -1] def BFS(X, Y) : que = [[X, Y]] while que : a, b = que[0][0], que[0][1] del que[0] for i in range(4) : x = a + dx[i] y = b + dy[i] if T[x][y] == '1' : T[x][y] = T[a][b] + 1 que.append([x, y]) elif type(..

import sys input = sys.stdin.readline Vn = int(input()) En = int(input()) V = {} for i in range(1, Vn + 1) : V[i] = [] for i in range(En) : v1, v2 = map(int, input().split()) V[v1].append(v2) V[v2].append(v1) for i in range(1, Vn + 1) : V[i].sort() gone = [1] count = 0 def BFS(now) : global count que = [now] while que : q = que[0] gone.append(q) del que[0] for i in V[q] : if not i in gone and no..