importsyssys.setrecursionlimit(300000)defdfs(graph,v,visited,k,a):visited[v]=Trueforiingraph[v]:ifnotvisited[i]:dfs(graph,i,visited,k,a)a[v]+=a[i]k[0]+=abs(a[i])a[i]=0defsolution(a,edges):answer=0sum=0foriina:# 판별sum+=iifsum!=0:# 판별하여 끝내기answer=-1returnanswergraph= [[]foriinrange(len(a))]foriinedges:graph[i[0]].append(i[1])graph[i[1]].append(i[0])visited= [False]*len(graph)k= [0]dfs(graph,1,visited,k,a)answer=k[0]returnanswer

{"probId":"76503","author":"jiseung","lang":"Python","createdAt":1679486605290}