提出 #17717380

---

ソースコード 拡げる

from sys import stdin
input = stdin.readline
from sys import setrecursionlimit
setrecursionlimit(100010)
def helper(curr):
    currA, currB = 0, 0
    for i in curr:
        taken.add(i)
        currA += a[i-1]
        currB += b[i-1]
    temp = []
    for i in curr:
        for j in adj[i]:
            if j not in taken:
                temp.append(j)
    
    if temp:
        call = helper(temp)
        currA, currB = currA + call[0], currB + call[1]
    return currA, currB
        
from collections import defaultdict
n, m  =    map(int, input().split())
a     =    list(map(int, input().split()))
b     =    list(map(int, input().split()))
adj   =    defaultdict(set)

for _ in range(m):
    c, d = map(int, input().split())
    adj[c].add(d)
    adj[d].add(c)

    
taken = set()
for i in range(1, n+1):
    if i not in taken:
        sa, sb = helper([i])
        if sa!=sb:
            print('No')
            break
else:
    print('Yes')

提出情報

ジャッジ結果