코드 import sys from collections import deque input = sys.stdin.readline n = int(input()) graph = [[] for _ in range(n+1)] indegree = [0]*(n+1) # 전입차수 기록 time = [0]*(n+1) # 시간기록 visited = [0]*(n+1) # 방문한 시간 기록 for i in range(1, n+1): lst = [*map(int, input().split())] time[i] = lst[0] for j in range(1, len(lst)-1): graph[lst[j]].append(i) indegree[i] += 1 def topol_sort(): queue = deque([]) for i ..
