結果

問題 No.74 貯金箱の退屈
コンテスト
ユーザー ntuda
提出日時 2025-09-01 00:16:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 68 ms / 5,000 ms
コード長 2,810 bytes
コンパイル時間 310 ms
コンパイル使用メモリ 82,568 KB
実行使用メモリ 68,736 KB
最終ジャッジ日時 2025-09-01 00:16:23
合計ジャッジ時間 3,617 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing


class DSU:
    '''
    Implement (union by size) + (path halving)

    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    '''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        x = self.leader(a)
        y = self.leader(b)

        if x == y:
            return x

        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x

        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x

        return x

    def same(self, a: int, b: int) -> bool:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        assert 0 <= a < self._n

        parent = self.parent_or_size[a]
        while parent >= 0:
            if self.parent_or_size[parent] < 0:
                return parent
            self.parent_or_size[a], a, parent = (
                self.parent_or_size[parent],
                self.parent_or_size[parent],
                self.parent_or_size[self.parent_or_size[parent]]
            )

        return a

    def size(self, a: int) -> int:
        assert 0 <= a < self._n

        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]

        result: typing.List[typing.List[int]] = [[] for _ in range(self._n)]
        for i in range(self._n):
            result[leader_buf[i]].append(i)

        return list(filter(lambda r: r, result))


N = int(input())
D = list(map(int, input().split()))
W = list(map(int, input().split()))

E = [set() for _ in range(N)]
for i in range(N):
    d = D[i]
    d = min(d % N, N - d % N)
    a = (i - d) % N
    b = (i + d) % N
    E[a].add(b)
    E[b].add(a)

D = [0] * N
Q = []
for i in range(N):
    D[i] =len(E[i])
    if D[i] == 0 and W[i] == 0:
        print("No")
        exit()
    if D[i] == 1:
        Q.append(i)

while Q:
    x = Q.pop()
    for y in list(E[x]):
        if x == y:
            W[x] = 1
            continue
        a = W[x] ^ 1
        W[x] = 1
        W[y] ^= a
        E[x].remove(y)
        E[y].remove(x)
        D[y] -= 1
        if D[y] == 1:
            Q.append(y)

dsu = DSU(N)
for x in range(N):
    for y in E[i]:
        dsu.merge(x,y)

for G in dsu.groups():
    cnt = 0
    if len(G) == 1:
        continue
    for g in G:
        if g in E[g]:
            continue
    for g in G:
        if W[g] == 0:
            cnt += 1
    if cnt % 2 == 1:
        print("No")
        exit()

print("Yes")
0