結果

問題 No.3113 How Many Liars Are There?
ユーザー 👑 獅子座じゃない人獅子座じゃない人
提出日時 2024-03-29 16:23:31
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,493 ms / 2,000 ms
コード長 3,956 bytes
コンパイル時間 557 ms
コンパイル使用メモリ 82,420 KB
実行使用メモリ 96,012 KB
最終ジャッジ日時 2024-04-14 08:10:19
合計ジャッジ時間 28,053 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
68,868 KB
testcase_01 AC 62 ms
69,040 KB
testcase_02 AC 68 ms
71,172 KB
testcase_03 AC 69 ms
71,096 KB
testcase_04 AC 1,086 ms
95,544 KB
testcase_05 AC 882 ms
94,944 KB
testcase_06 AC 717 ms
95,432 KB
testcase_07 AC 930 ms
95,748 KB
testcase_08 AC 1,126 ms
95,812 KB
testcase_09 AC 1,062 ms
95,552 KB
testcase_10 AC 923 ms
95,640 KB
testcase_11 AC 560 ms
95,280 KB
testcase_12 AC 1,127 ms
95,640 KB
testcase_13 AC 931 ms
95,508 KB
testcase_14 AC 1,103 ms
95,808 KB
testcase_15 AC 1,493 ms
96,012 KB
testcase_16 AC 782 ms
94,800 KB
testcase_17 AC 781 ms
95,228 KB
testcase_18 AC 1,198 ms
95,736 KB
testcase_19 AC 1,198 ms
95,692 KB
testcase_20 AC 179 ms
81,148 KB
testcase_21 AC 175 ms
81,256 KB
testcase_22 AC 174 ms
80,952 KB
testcase_23 AC 176 ms
80,912 KB
testcase_24 AC 149 ms
79,616 KB
testcase_25 AC 97 ms
78,220 KB
testcase_26 AC 101 ms
78,584 KB
testcase_27 AC 167 ms
79,644 KB
testcase_28 AC 265 ms
82,436 KB
testcase_29 AC 173 ms
80,576 KB
testcase_30 AC 901 ms
91,528 KB
testcase_31 AC 64 ms
70,568 KB
testcase_32 AC 429 ms
87,376 KB
testcase_33 AC 525 ms
86,472 KB
testcase_34 AC 180 ms
81,072 KB
testcase_35 AC 294 ms
83,436 KB
testcase_36 AC 804 ms
94,828 KB
testcase_37 AC 184 ms
80,872 KB
testcase_38 AC 333 ms
88,460 KB
testcase_39 AC 782 ms
89,216 KB
testcase_40 AC 121 ms
79,256 KB
testcase_41 AC 322 ms
86,120 KB
testcase_42 AC 287 ms
84,592 KB
testcase_43 AC 660 ms
87,344 KB
testcase_44 AC 64 ms
69,724 KB
testcase_45 AC 65 ms
69,016 KB
testcase_46 AC 66 ms
69,588 KB
testcase_47 AC 66 ms
69,104 KB
testcase_48 AC 66 ms
69,200 KB
testcase_49 AC 65 ms
68,884 KB
testcase_50 AC 65 ms
69,512 KB
testcase_51 AC 66 ms
69,880 KB
testcase_52 AC 66 ms
68,768 KB
testcase_53 AC 66 ms
69,484 KB
testcase_54 AC 65 ms
70,024 KB
testcase_55 AC 66 ms
69,244 KB
testcase_56 AC 65 ms
68,632 KB
testcase_57 AC 65 ms
69,284 KB
testcase_58 AC 65 ms
69,516 KB
testcase_59 AC 66 ms
69,560 KB
testcase_60 AC 63 ms
68,592 KB
testcase_61 AC 64 ms
68,840 KB
testcase_62 AC 64 ms
69,380 KB
testcase_63 AC 65 ms
68,988 KB
権限があれば一括ダウンロードができます

ソースコード

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))

from collections import deque

n,k=map(int, input().split())
p=list(map(lambda x: int(x)-1, input().split()))
a=list(map(int, input().split()))

indeg=[0]*n
uf=DSU(n)
is_root=[False]*n
is_root_next=[False]*n

for v in range(n):
    if uf.same(v, p[v]):
        is_root[v]=True
        is_root_next[p[v]]=True
    else:
        indeg[p[v]]+=1
    uf.merge(v, p[v])

ans=[False]*(2*n+1)
dp=[[0 for _ in range(2*n+1)] for _ in range(n)]
size=[1]*n
ans_size=0
groups=uf.groups()
ans[0]=True

for group in groups:
    queue=deque()
    for v in group:
        if indeg[v]==0:
            queue.appendleft(v)
        for c_v in [0,1]:
            for c_p in [0,1]:
                for c_s in [0,1]:
                    dp[v][c_v+(a[v]+c_v+c_p)%2]|=1<<(4*c_v+2*c_p+c_s)

    while len(queue)>0:
        v=queue.pop()

        if is_root[v]:
            dp_p=[False]*(2*(size[v]+ans_size)+1)
            for i in range(2*size[v]+1):
                for c_v in [0,1]:
                    for c_p in [0,1]:
                        for j in range(2*ans_size+1):
                            dp_p[i+j]|=(dp[v][i]>>(4*c_v+3*c_p))&ans[j]&1

            ans_size+=size[v]
            for i in range(2*ans_size+1):
                ans[i]=dp_p[i]

        else:
            dp_p=[0 for _ in range(2*(size[v]+size[p[v]])+1)]
            for i in range(2*size[v]+1):
                for c_v in [0,1]:
                    for c_p in [0,1]:
                        for c_pp in [0,1]:
                            for j in range(2*size[p[v]]+1):
                                if is_root_next[v]:
                                    dp_p[i+j]|=((dp[v][i]>>(5*c_v+2*c_p))&(dp[p[v]][j]>>(4*c_p+2*c_pp+c_v))&1)<<(4*c_p+2*c_pp+c_v)
                                else:
                                    for c_s in [0,1]:
                                        dp_p[i+j]|=((dp[v][i]>>(4*c_v+2*c_p+c_s))&(dp[p[v]][j]>>(4*c_p+2*c_pp+c_s))&1)<<(4*c_p+2*c_pp+c_s)

            size[p[v]]+=size[v]
            for i in range(2*size[p[v]]+1):
                dp[p[v]][i]=dp_p[i]

            indeg[p[v]]-=1
            if indeg[p[v]]==0:
                queue.appendleft(p[v])

print("Yes" if ans[k] else "No")
0