結果

問題 No.2780 The Bottle Imp
ユーザー hato336hato336
提出日時 2024-06-07 23:48:44
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 4,906 bytes
コンパイル時間 203 ms
コンパイル使用メモリ 82,792 KB
実行使用メモリ 179,776 KB
最終ジャッジ日時 2024-06-08 10:39:50
合計ジャッジ時間 15,444 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 AC 142 ms
88,832 KB
testcase_03 RE -
testcase_04 AC 140 ms
89,088 KB
testcase_05 RE -
testcase_06 AC 138 ms
88,960 KB
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 AC 305 ms
116,964 KB
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 AC 453 ms
179,776 KB
testcase_35 RE -
testcase_36 AC 141 ms
88,960 KB
testcase_37 AC 151 ms
88,940 KB
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 AC 141 ms
88,704 KB
testcase_43 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline

#
#alist = []
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

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

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = collections.defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return ''.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def scc(N,edges):
    M=len(edges)
    start=[0]*(N+1)
    elist=[0]*M
    for e in edges:
        start[e[0]+1]+=1
    for i in range(1,N+1):
        start[i]+=start[i-1]
    counter=start[:]
    for e in edges:
        elist[counter[e[0]]]=e[1]
        counter[e[0]]+=1
    visited=[]
    low=[0]*N
    Ord=[-1]*N
    ids=[0]*N
    NG=[0,0]
    def dfs(v):
        stack=[(v,-1,0),(v,-1,1)]
        while stack:
            v,bef,t=stack.pop()
            if t:
                if bef!=-1 and Ord[v]!=-1:
                    low[bef]=min(low[bef],Ord[v])
                    stack.pop()
                    continue
                low[v]=NG[0]
                Ord[v]=NG[0]
                NG[0]+=1
                visited.append(v)
                for i in range(start[v],start[v+1]):
                    to=elist[i]
                    if Ord[to]==-1:
                        stack.append((to,v,0))
                        stack.append((to,v,1))
                    else:
                        low[v]=min(low[v],Ord[to])
            else:
                if low[v]==Ord[v]:
                    while(True):
                        u=visited.pop()
                        Ord[u]=N
                        ids[u]=NG[1]
                        if u==v:
                            break
                    NG[1]+=1
                low[bef]=min(low[bef],low[v])
    for i in range(N):
        if Ord[i]==-1:
            dfs(i)
    for i in range(N):
        ids[i]=NG[1]-1-ids[i]
    group_num=NG[1]
    counts=[0]*group_num
    for x in ids:
        counts[x]+=1
    groups=[[] for i in range(group_num)]
    for i in range(N):
        groups[ids[i]].append(i)
    return groups
n = int(input())
uf = UnionFind(n)
e = []
edge = [[] for i in range(n)]
for i in range(n):
    a = list(map(int,input().split()))
    for j in a[1:]:
        edge[i].append(j-1)
        e.append((i,j-1))
x = scc(n,e)


for i in x:
    for j in range(len(i)-1):
        uf.union(i[j],i[j+1])
t = uf.all_group_members()
z = []
ed = [set() for i in range(n)]
for k in range(n):
    if k != uf.find(k):
        continue
    z.append(k)
    for i in t[k]:
        for j in edge[i]:
            ed[k].add(uf.find(j))
deg = [0 for i in range(n)]
for i in range(n):
    ed[i] = list(ed[i])
    for j in ed[i]:
        deg[j] += 1

from collections import deque
def topological_sort(node, input_edge):
    """トポロジカルソート

    有向グラフの順序を守るようにソートする
    閉路があるか判定も出来る
    計算量: O(E+V)

    Args:
        node (list): edge[i] = [a, b,...] iからa,b,...に辺が伸びている
        input_edge (list): input_edge[i] = iの入力辺の本数

    Returns:
        list or -1:閉路が存在しないとき
                      ソート済みのリスト
                   閉路が存在する時
                      -1   
    """
    N = len(input_edge)
    ans = [i for i in range(N) if input_edge[i] == 0]
    que = deque(ans)
    while que:
        q = que.popleft()
        for e in node[q]:
            input_edge[e] -= 1
            if input_edge[e] == 0:
                que.append(e)
                ans.append(e)
    if len(ans) == N:
        return ans
    return -1
tp = topological_sort(ed,deg)
dp = [0 for i in range(n)]
dp[uf.find(0)] = 1
for i in tp:
    for j in ed[i]:
        dp[j] = max(dp[j],dp[i]+1)
if len(z) == max(dp):
    print('Yes')
else:
    print('No')
0