백준 1707 - 이분 그래프

12345678910111213141516171819202122232425262728293031323334353637383940import syssys.setrecursionlimit(10000000) def prt_ans(): for i in range(1,v+1): for j in graph[i]: if visit[i][1] == visit[j][1]: return "NO" return "YES" def dfs(vertex): visit[vertex][0] = 1 ans.append(vertex) for i in graph[vertex]: if visit[i][0] == 0: visit[i][1] = not visit[vertex][1] dfs(i) k = int(sys.stdin.readline())graph = []visit = []ans = [] for _ in range(k): ans = [0] v, e = map(int, sys.stdin.readline().split()) graph = [[] for _ in range(v+1)] visit = [[0]*2 for _ in range(v+1)] for _ in range(e): fr, to = ..........

원문링크 : 백준 1707 - 이분 그래프