풀캠정글러

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 import sys input = sys.stdin.readline from collections import deque Vn, En = map(int, input().split()) V = {} upper = 1 lower = 1000000000 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]) V[v2].append([v1, c]) u..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) testcase = int(input()) for i in range(testcase) : Vn, En = map(int, input().split()) B = [0] + list(map(int, input().split())) V = {} child = [0 for i in range(Vn + 1)] for i in range(1, Vn + 1) : V[i] = [] for i in range(En) : v1, v2 = map(int, ..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 import sys input = sys.stdin.readline from collections import deque n, m = map(int, input().split()) T = [] que = deque() for i in range(n) : T.append(list(map(int, input().split())) + [None]) for j in range(m..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) Vn = int(input()) En = int(input()) V = {} child = [0 for i in range(Vn + 1)] 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]) child[v1] = child..

import sys input = sys.stdin.readline import heapq n = int(input()) child = [0 for i in range(n + 1)] V = [[] for i in range(n + 1)] for i in range(1, n + 1) : l = list(input()) for j in range(1, n + 1) : if l[j-1] == '1' : V[j].append(i) child[i] = child[i] + 1 child[0] = None if 0 not in child : print(-1) exit(0) heap = [] for i in range(1, n + 1) : if child[i] == 0 : heapq.heappush(heap, -i) ..

import sys input = sys.stdin.readline from collections import deque n = int(input()) m = int(input()) basic = [True for i in range(n + 1)] parent = [0 for i in range(n)] V = [[] for i in range(n + 1)] for i in range(m) : p, c, k = map(int, input().split()) V[p].append([c, k]) basic[p] = False parent[c] = parent[c] + 1 table = [0 for i in range(n)] que = deque() for i in range(1, n) : if parent[i..

import sys input = sys.stdin.readline from collections import deque Vn, En = map(int, input().split()) parent = [0 for i in range(Vn + 1)] V = [[] for i in range(Vn + 1)] for i in range(En) : big, small = map(int, input().split()) V[big].append(small) parent[small] = parent[small] + 1 que = deque() for i in range(1, Vn + 1) : if parent[i] == 0 : que.append(i) while que : now = que.popleft() prin..

import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) Vn, En = map(int, input().split()) V = [[] for i in range(Vn + 1)] U = [[] for i in range(Vn + 1)] for i in range(En) : big, small = map(int, input().split()) V[big].append(small) U[small].append(big) def DFS(dic, now) : gone[now] = True for next in dic[now] : if not gone[next] : DFS(dic, next) count = 0 for i in range(1, Vn + 1)..

n = int(input()) a = list(map(int, input().split())) C = list(map(int, input().split())) minv = 1000000000 maxv = -minv def DFS(value, i, op, left1, left2, left3, left4) : if op == 1 : value = value + a[i] elif op == 2 : value = value - a[i] elif op == 3 : value = value * a[i] else : value = int(value / a[i]) if i == n - 1 : global maxv, minv maxv = max(maxv, value) minv = min(minv, value) else ..

import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) def DFS(v) : global flag for next in V[v] : if C[next] == 0 : C[next] = - C[v] DFS(next) elif C[next] == C[v] : flag = False k = int(input()) for i in range(k) : Vn, En = map(int, input().split()) V = [[] for i in range(Vn + 1)] C = [0 for i in range(Vn + 1)] for i in range(En) : v1, v2 = map(int, input().split()) V[v1].append(v2..