무럭무럭 자라라

""" *packageName : * fileName : 1743_음식물 피하기_S1 * author : jihye94 * date : 2022-04-29 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-29 jihye94 최초 생성 """ from collections import deque def bfs(i, j): print("==========================================") queue.append((i, j)) vis..

""" *packageName : * fileName : 2178_미로탐색_S1 * author : ipeac * date : 2022-04-13 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-13 ipeac 최초 생성 """ from collections import deque def bfs(i, j): queue.append((i, j)) visited[i][j] = 1 while queue: x, y = queue.popleft() for k in..

""" *packageName : * fileName : 해시_완주하지못한선수 * author : ipeac * date : 2022-04-20 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-20 ipeac 최초 생성 """ import collections def solution(participant, completion): participant.sort() completion.sort() res = collections.Counter(particip..

""" *packageName : * fileName : 1697_숨바꼭질_S1 * author : ipeac * date : 2022-04-19 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-19 ipeac 최초 생성 """ from collections import deque n, k = map(int, input().split()) graph = [0 for _ in range(10 ** 6)] def bfs(x): queue = deque([x]..

""" *packageName : * fileName : 2667_단지번호붙이기_S1 * author : ipeac * date : 2022-04-19 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-19 ipeac 최초 생성 """ from collections import deque res = [] dx = [0, 1, -1, 0] dy = [1, 0, 0, -1] n = int(input()) graph = [list(map(int, input())..

""" *packageName : * fileName : 16173_점프왕쩰리_S4 * author : ipeac * date : 2022-04-13 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-13 ipeac 최초 생성 """ import sys sys.setrecursionlimit(10 ** 5) def dfs(x, y): if x = n or y = n: return False if visited[x][y]:..

""" *packageName : * fileName : 1388_바닥_장식_S4 * author : qkrtk * date : 2022-04-10 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-10 qkrtk 최초 생성 """ import sys sys.setrecursionlimit(10 ** 5) n, m = map(int, input().split()) graph = [list(map(str, input())) for _ in range(n)] ..

""" *packageName : * fileName : 11725_트리의부모찾기_S2 * author : qkrtk * date : 2022-04-08 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-08 qkrtk 최초 생성 """ import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 5) # n 정점이자 노드루트의 개수 n = int(input()) graph = [[] for _ in..