結果

問題 No.2780 The Bottle Imp
ユーザー vwxyzvwxyz
提出日時 2024-07-14 22:50:08
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
WA  
実行時間 -
コード長 6,255 bytes
コンパイル時間 295 ms
コンパイル使用メモリ 13,184 KB
実行使用メモリ 72,864 KB
最終ジャッジ日時 2024-07-14 22:50:31
合計ジャッジ時間 21,126 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
11,264 KB
testcase_01 AC 30 ms
11,264 KB
testcase_02 AC 30 ms
11,136 KB
testcase_03 AC 33 ms
11,264 KB
testcase_04 AC 31 ms
11,264 KB
testcase_05 AC 31 ms
11,264 KB
testcase_06 AC 31 ms
11,136 KB
testcase_07 AC 620 ms
37,076 KB
testcase_08 AC 615 ms
36,828 KB
testcase_09 AC 658 ms
37,064 KB
testcase_10 AC 606 ms
36,796 KB
testcase_11 AC 643 ms
37,064 KB
testcase_12 AC 1,362 ms
67,924 KB
testcase_13 AC 1,347 ms
67,920 KB
testcase_14 AC 383 ms
25,088 KB
testcase_15 AC 354 ms
25,344 KB
testcase_16 AC 350 ms
25,344 KB
testcase_17 AC 345 ms
25,216 KB
testcase_18 AC 369 ms
25,344 KB
testcase_19 AC 355 ms
25,344 KB
testcase_20 AC 361 ms
25,216 KB
testcase_21 AC 372 ms
25,344 KB
testcase_22 AC 227 ms
20,224 KB
testcase_23 AC 303 ms
22,784 KB
testcase_24 AC 523 ms
33,440 KB
testcase_25 AC 924 ms
47,264 KB
testcase_26 AC 449 ms
29,448 KB
testcase_27 AC 362 ms
28,940 KB
testcase_28 AC 371 ms
29,068 KB
testcase_29 AC 431 ms
31,424 KB
testcase_30 AC 405 ms
34,096 KB
testcase_31 AC 639 ms
43,228 KB
testcase_32 AC 262 ms
19,328 KB
testcase_33 AC 710 ms
47,700 KB
testcase_34 AC 1,050 ms
72,864 KB
testcase_35 AC 193 ms
18,176 KB
testcase_36 AC 30 ms
11,264 KB
testcase_37 AC 30 ms
11,264 KB
testcase_38 AC 204 ms
18,176 KB
testcase_39 AC 579 ms
37,424 KB
testcase_40 AC 568 ms
37,292 KB
testcase_41 AC 573 ms
37,296 KB
testcase_42 WA -
testcase_43 AC 31 ms
11,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def SCC(N,edges):
    start = [0] * (N + 1)
    elist = [0] * len(edges)
    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
    N = N
    now_ord = group_num = 0
    visited = []
    low = [0] * N
    order = [-1] * N
    ids = [0] * N
    parent = [-1] * N
    stack = []
    for i in range(N):
        if order[i] == -1:
            stack.append(i)
            stack.append(i)
            while stack:
                v = stack.pop()
                if order[v] == -1:
                    low[v] = order[v] = now_ord
                    now_ord += 1
                    visited.append(v)
                    for i in range(start[v], start[v + 1]):
                        to = elist[i]
                        if order[to] == -1:
                            stack.append(to)
                            stack.append(to)
                            parent[to] = v
                        else:
                            low[v] = min(low[v], order[to])
                else:
                    if low[v] == order[v]:
                        while True:
                            u = visited.pop()
                            order[u] = N
                            ids[u] = group_num
                            if u == v:
                                break
                        group_num += 1
                    if parent[v] != -1:
                        low[parent[v]] = min(low[parent[v]], low[v])
    for i, x in enumerate(ids):
        ids[i] = group_num - 1 - x
    groups = [[] for _ in range(group_num)]
    for i, x in enumerate(ids):
        groups[x].append(i)
    return groups
from collections import defaultdict

class UnionFind:
    def __init__(self,N,label=None,f=None,weighted=False,rollback=False):
        self.N=N
        self.parents=[None]*self.N
        self.size=[1]*self.N
        self.roots={i for i in range(self.N)}
        self.label=label
        if self.label!=None:
            self.label=[x for x in label]
        self.f=f
        self.weighted=weighted
        if self.weighted:
            self.weight=[0]*self.N
        self.rollback=rollback
        if self.rollback:
            self.operate_list=[]
            self.operate_set=[]

    def Find(self,x):
        stack=[]
        while self.parents[x]!=None:
            stack.append(x)
            x=self.parents[x]
        if not self.rollback:
            if self.weighted:
                w=0
                for y in stack[::-1]:
                    self.parents[y]=x
                    w+=self.weight[y]
                    self.weight[y]=w
            else:
                for y in stack[::-1]:
                    self.parents[y]=x
        return x

    def Union(self,x,y,w=None):
        root_x=self.Find(x)
        root_y=self.Find(y)
        if self.rollback:
            self.operate_list.append([])
            self.operate_set.append([])
        if root_x==root_y:
            if self.weighted:
                if self.weight[y]-self.weight[x]==w:
                    return True
                else:
                    return False
        else:
            if self.size[root_x]<self.size[root_y]:
                x,y=y,x
                root_x,root_y=root_y,root_x
                if self.weighted:
                    w=-w
            if self.rollback:
                self.operate_list[-1].append((self.parents,root_y,self.parents[root_y]))
                self.operate_list[-1].append((self.size,root_x,self.size[root_x]))
                self.operate_set[-1].append(root_y)
                if self.label!=None:
                    self.operate_list[-1]((self.label,root_x,self.label[root_x]))
                if self.weighted:
                    self.operate_list[-1].append((self.weight,root_y,self.weight[root_y]))
            self.parents[root_y]=root_x
            self.size[root_x]+=self.size[root_y]
            self.roots.remove(root_y)
            if self.label!=None:
                self.label[root_x]=self.f(self.label[root_x],self.label[root_y])
            if self.weighted:
                self.weight[root_y]=w+self.weight[x]-self.weight[y]

    def Size(self,x):
        return self.size[self.Find(x)]

    def Same(self,x,y):
        return self.Find(x)==self.Find(y)

    def Label(self,x):
        return self.label[self.Find(x)]

    def Weight(self,x,y):
        root_x=self.Find(x)
        root_y=self.Find(y)
        if root_x!=root_y:
            return None
        return self.weight[y]-self.weight[x]

    def Roots(self):
        return list(self.roots)

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

    def Linked_Components(self):
        linked_components=defaultdict(list)
        for x in range(self.N):
            linked_components[self.Find(x)].append(x)
        return linked_components

    def Rollback(self):
        assert self.rollback
        if self.operate_list:
            for lst,x,v in self.operate_list.pop():
                lst[x]=v
            for x in self.operate_set.pop():
                self.roots.add(x)            
            return True
        else:
            return False

    def __str__(self):
        linked_components=defaultdict(list)
        for x in range(self.N):
            linked_components[self.Find(x)].append(x)
        return "\n".join(f"{r}: {linked_components[r]}" for r in sorted(list(linked_components.keys())))

N=int(input())
edges=[]
UF=UnionFind(N)
for n in range(N):
    M,*A=map(int,input().split())
    for a in A:
        a-=1
        edges.append((n,a))
        UF.Union(n,a)
groups=SCC(N,edges)
le=len(groups)
idx=[None]*N
for i,lc in enumerate(groups):
    for x in lc:
        idx[x]=i
graph=[[] for x in range(le)]
graph_rev=[[] for x in range(le)]
ans="Yes"
for a,b in edges:
    if idx[a]!=idx[b]:
        if idx[b]==idx[0]:
            ans="No"
        graph[idx[a]].append(idx[b])
        graph_rev[idx[b]].append(idx[a])
for x in range(le):
    if graph[x] and min(graph[x])!=max(graph[x]):
        ans="No"
    if idx[x]!=idx[0] and not graph_rev[x]:
        ans="No"
if UF.Linked_Components_Count()!=1:
    ans="No"
print(ans)
0