(백준 #3977) Soccer Tactics (Python3)
import sys input = sys.stdin.readline sys.setrecursionlimit(10**6) def DFS(now): global id visited(now) = nowid = id stack.append(now) for next in graph(now): if not visited(next): id += 1 DFS(next) visited(now) = min(visited(now),visited(next)) if visited(now) == nowid: n = len(scc); scc.append(()) while 1: x = stack.pop() visited(x) = 1e7 scc(-1).append(x); sccnum(x) = n if x==now: break for _ … Read more