Submission #17611116

---

Source Code Expand

import sys
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def from_read(dtype=np.int64):
    return np.fromstring(read().decode(), dtype=dtype, sep=' ')


def from_readline(dtype=np.int64):
    return np.fromstring(readline().decode(), dtype=dtype, sep=' ')

@njit
def find_root(uf, x):
    root = uf[0]
    while root[x] != x:
        root[x] = root[root[x]]
        x = root[x]
    return x


@njit
def merge(uf, x, y):
    root, size = uf
    x, y = find_root(uf, x), find_root(uf, y)
    if x == y:
        return False
    if size[x] < size[y]:
        x, y = y, x
    size[x] += size[y]
    root[y] = root[x]
    return True

@njit((i8[:], i8[:], i8[:, :]), cache=True)
def main(A, B, G):
    N = len(A)
    root = np.arange(N + 1)
    size = np.ones_like(root)
    uf = (root, size)

    M = len(G)
    for e in range(M):
        c, d = G[e]
        merge(uf, c, d)

    comp_sum = np.zeros(N + 1, np.int64)
    for i in range(1, N + 1):
        r = find_root(uf, i)
        comp_sum[r] += A[i - 1] - B[i - 1]
    return np.all(comp_sum == 0)

N, M = map(int, readline().split())
A = from_readline()
B = from_readline()
G = from_read().reshape(M, 2)

print('Yes' if main(A, B, G) else 'No')

Submission Info

Judge Result