Submission #17651342

---

Source Code Expand

import sys
from collections import defaultdict


def IN_I(): return int(sys.stdin.readline().rstrip())
def IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def IN_S(): return sys.stdin.readline().rstrip()
def IN_LS(): return list(sys.stdin.readline().rstrip().split())
INF = float('inf')


class UnionFind:
    def __init__(self, n):
        self.n = n # 頂点数
        self.par = [i for i in range(n)] # 親
        self.rank = [0 for _ in range(n)] # 根の深さ

    # xの属する木の根を求める
    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    # xとyの属する集合のマージ
    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.rank[x] < self.rank[y]:
            self.par[x] = y
        else:
            self.par[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1

    # xとyが同じ集合に属するかを判定
    def same(self, x, y):
        return self.find(x) == self.find(y)

    # すべての要素を親別に格納
    def get_groups(self):
        groups = defaultdict(list)
        for m in range(self.n):
            groups[self.find(m)].append(m)
        return groups


N, M = IN_LI()
A = IN_LI()
B = IN_LI()
uf = UnionFind(N)
for i in range(M):
    c, d = IN_LI()
    uf.unite(c-1, d-1)
trees = uf.get_groups()
for k, v in trees.items():
    sum_a = 0
    sum_b = 0
    for m in v:
        sum_a += A[m]
        sum_b += B[m]
    if sum_a != sum_b:
        print('No')
        exit()
print('Yes')

Submission Info

Judge Result