풀캠정글러

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

import sys input = sys.stdin.readline Vn, En = 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) V[v2].append(v1) gone = [] count = 0 def BFS(now) : que = [now] while que : q = que[0] gone.append(q) del que[0] for i in V[q] : if not i in gone and not i in que : que.append(i) for i in range(1, Vn + 1) : ..

import sys input = sys.stdin.readline Vn, En, v = 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) V[v2].append(v1) for i in range(1, Vn + 1) : V[i].sort() gone = [] def DFS(now) : print(now, end = ' ') gone.append(now) for i in V[now] : if not i in gone : DFS(i) DFS(v) print() gone = [] def BFS(now) :..

import sys input = sys.stdin.readline Vn, En = map(int, input().split()) V = {} E = [] for i in range(1, Vn + 1) : V[i] = i for i in range(En) : E.append(list(map(int, input().split()))) E.sort(key = lambda x : x[2]) def endof(x) : if V[x] == x : return x return endof(V[x]) def check(a, b) : if endof(a) == endof(b) : return True return False def connect(a, b) : if endof(a) < endof(b) : V[endof(a..

import sys sys.setrecursionlimit(10**8) input = sys.stdin.readline l = [] while True: try: l.append(int(input())) except: break def DAC(left, right) : if left > right : return if left == right : print(l[left]) return i = left + 1 if l[right] < l[left] : DAC(left + 1, right) else : while i

n = int(input()) dic = {} for i in range(n) : x, y1, y2 = input().split() dic[x] = [y1, y2] def preorder(x) : print(x, end = '') if dic[x][0] != '.' : preorder(dic[x][0]) if dic[x][1] != '.' : preorder(dic[x][1]) def inorder(x) : if dic[x][0] != '.' : inorder(dic[x][0]) print(x, end = '') if dic[x][1] != '.' : inorder(dic[x][1]) def postorder(x) : if dic[x][0] != '.' : postorder(dic[x][0]) if di..

import sys input = sys.stdin.readline import heapq l = [] xpick= {0} n = int(input()) for i in range(n) : elem = list(map(int, input().split())) l.append(elem) xpick.add(elem[0]) xpick.add(elem[2]) l.sort(key=lambda x : (x[0], -x[1])) xpick = sorted(list(xpick)) del xpick[0] i = 0 heap = [] for now in xpick : while i < n and l[i][0] == now : if heap == [] : print(l[i][0], end = ' ') print(l[i][1..

import sys input = sys.stdin.readline import heapq l = [] n = int(input()) for i in range(n) : elem = list(map(int, input().split())) l.append(elem) l.append([0, 0, 1000000002]) l.append([1000000001, 0, 1000000002]) l.sort(key=lambda x : (x[0], -x[1])) heap = [[0, 0, 1000000002]] for a, h, b in l : if a == 0 : continue else : trash = [] hnow = 0 while heap[0][2] -heap[0][0] and h > hnow : print(..

word = input() boom = list(input()) stack = [] count = 0 for i in range(len(word)) : stack.append(word[i]) if len(stack) >= len(boom) : if stack[len(stack) - len(boom) :] == boom : for i in range(len(boom)) : del stack[-1] if stack == [] : print('FRULA') else : print("".join(stack)) stack이 boom보다 짧을 동안에는, stack이 boom과 같아질 리가 없으므로 무조건 다음 글자를 넣는다. stack의 길이가 boom 이상일 때에는 stack의 뒤 len(boom)개의 원소를 b..