#1015305 (PyPy3) No.2914 正閉路検出

提出ソース

結果

問題	No.2914 正閉路検出
ユーザー	vwxyz
提出日時	2024-10-04 21:55:18
言語	PyPy3 (7.3.15)
結果	AC
実行時間	684 ms / 2,000 ms
コード長	10,992 bytes
コンパイル時間	235 ms
コンパイル使用メモリ	82,036 KB
実行使用メモリ	192,328 KB
最終ジャッジ日時	2024-10-04 21:55:42
合計ジャッジ時間	15,917 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 58,964 KB
testcase_01	AC	47 ms 59,188 KB
testcase_02	AC	43 ms 58,692 KB
testcase_03	AC	62 ms 58,976 KB
testcase_04	AC	43 ms 58,464 KB
testcase_05	AC	42 ms 58,360 KB
testcase_06	AC	43 ms 58,824 KB
testcase_07	AC	43 ms 58,832 KB
testcase_08	AC	43 ms 58,312 KB
testcase_09	AC	44 ms 58,176 KB
testcase_10	AC	44 ms 58,796 KB
testcase_11	AC	43 ms 58,148 KB
testcase_12	AC	45 ms 59,300 KB
testcase_13	AC	45 ms 58,440 KB
testcase_14	AC	44 ms 58,348 KB
testcase_15	AC	58 ms 58,896 KB
testcase_16	AC	44 ms 59,560 KB
testcase_17	AC	44 ms 59,792 KB
testcase_18	AC	43 ms 58,316 KB
testcase_19	AC	109 ms 78,164 KB
testcase_20	AC	145 ms 78,084 KB
testcase_21	AC	95 ms 77,952 KB
testcase_22	AC	178 ms 78,204 KB
testcase_23	AC	135 ms 78,544 KB
testcase_24	AC	163 ms 78,328 KB
testcase_25	AC	85 ms 77,816 KB
testcase_26	AC	130 ms 77,908 KB
testcase_27	AC	208 ms 78,172 KB
testcase_28	AC	291 ms 84,868 KB
testcase_29	AC	470 ms 142,848 KB
testcase_30	AC	133 ms 94,032 KB
testcase_31	AC	225 ms 78,500 KB
testcase_32	AC	277 ms 85,956 KB
testcase_33	AC	151 ms 93,564 KB
testcase_34	AC	489 ms 155,852 KB
testcase_35	AC	527 ms 155,224 KB
testcase_36	AC	545 ms 159,952 KB
testcase_37	AC	436 ms 184,224 KB
testcase_38	AC	315 ms 147,940 KB
testcase_39	AC	357 ms 138,224 KB
testcase_40	AC	684 ms 192,328 KB
testcase_41	AC	377 ms 145,472 KB
testcase_42	AC	540 ms 183,960 KB
testcase_43	AC	509 ms 189,536 KB
testcase_44	AC	301 ms 128,716 KB
testcase_45	AC	496 ms 180,264 KB
testcase_46	AC	464 ms 174,520 KB
testcase_47	AC	431 ms 166,576 KB
testcase_48	AC	356 ms 139,956 KB
testcase_49	AC	462 ms 175,676 KB
testcase_50	AC	440 ms 166,692 KB
testcase_51	AC	291 ms 127,360 KB
testcase_52	AC	317 ms 134,420 KB
testcase_53	AC	334 ms 137,856 KB
testcase_54	AC	326 ms 136,724 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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())))
import heapq
import random
from collections import defaultdict,deque

class Graph:
    def __init__(self,V,edges=None,graph=None,directed=False,weighted=False,inf=float("inf")):
        self.V=V
        self.directed=directed
        self.weighted=weighted
        self.inf=inf
        if graph!=None:
            self.graph=graph
            """
            self.edges=[]
            for i in range(self.V):
                if self.weighted:
                    for j,d in self.graph[i]:
                        if self.directed or not self.directed and i<=j:
                            self.edges.append((i,j,d))
                else:
                    for j in self.graph[i]:
                        if self.directed or not self.directed and i<=j:
                            self.edges.append((i,j))
            """
        else:
            self.edges=edges
            self.graph=[[] for i in range(self.V)]
            if weighted:
                for i,j,d in self.edges:
                    self.graph[i].append((j,d))
                    if not self.directed:
                        self.graph[j].append((i,d))
            else:
                for i,j in self.edges:
                    self.graph[i].append(j)
                    if not self.directed:
                        self.graph[j].append(i)

    def SIV_DFS(self,s,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):
        seen=[False]*self.V
        finished=[False]*self.V
        if directed_acyclic or cycle_detection or topological_sort:
            dag=True
        if euler_tour:
            et=[]
        if linked_components:
            lc=[]
        if lowlink:
            order=[None]*self.V
            ll=[None]*self.V
            idx=0
        if parents or cycle_detection or lowlink or subtree_size:
            ps=[None]*self.V
        if postorder or topological_sort:
            post=[]
        if preorder:
            pre=[]
        if subtree_size:
            ss=[1]*self.V
        if unweighted_dist or bipartite_graph:
            uwd=[self.inf]*self.V
            uwd[s]=0
        if weighted_dist:
            wd=[self.inf]*self.V
            wd[s]=0
        stack=[(s,0)] if self.weighted else [s]
        while stack:
            if self.weighted:
                x,d=stack.pop()
            else:
                x=stack.pop()
            if not seen[x]:
                seen[x]=True
                stack.append((x,d) if self.weighted else x)
                if euler_tour:
                    et.append(x)
                if linked_components:
                    lc.append(x)
                if lowlink:
                    order[x]=idx
                    ll[x]=idx
                    idx+=1
                if preorder:
                    pre.append(x)
                for y in self.graph[x]:
                    if self.weighted:
                        y,d=y
                    if not seen[y]:
                        stack.append((y,d) if self.weighted else y)
                        if parents or cycle_detection or lowlink or subtree_size:
                            ps[y]=x
                        if unweighted_dist or bipartite_graph:
                            uwd[y]=uwd[x]+1
                        if weighted_dist:
                            wd[y]=wd[x]+d
                    elif not finished[y]:
                        if (directed_acyclic or cycle_detection or topological_sort) and dag:
                            dag=False
                            if cycle_detection:
                                cd=(y,x)
            elif not finished[x]:
                finished[x]=True
                if euler_tour:
                    et.append(~x)
                if lowlink:
                    bl=True
                    for y in self.graph[x]:
                        if self.weighted:
                            y,d=y
                        if ps[x]==y and bl:
                            bl=False
                            continue
                        ll[x]=min(ll[x],order[y])
                    if x!=s:
                        ll[ps[x]]=min(ll[ps[x]],ll[x])
                if postorder or topological_sort:
                    post.append(x)
                if subtree_size:
                    for y in self.graph[x]:
                        if self.weighted:
                            y,d=y
                        if y==ps[x]:
                            continue
                        ss[x]+=ss[y]
        if bipartite_graph:
            bg=[[],[]]
            for tpl in self.edges:
                x,y=tpl[:2] if self.weighted else tpl
                if uwd[x]==self.inf or uwd[y]==self.inf:
                    continue
                if not uwd[x]%2^uwd[y]%2:
                    bg=False
                    break
            else:
                for x in range(self.V):
                    if uwd[x]==self.inf:
                        continue
                    bg[uwd[x]%2].append(x)
        retu=()
        if bipartite_graph:
            retu+=(bg,)
        if cycle_detection:
            if dag:
                cd=[]
            else:
                y,x=cd
                cd=self.Route_Restoration(y,x,ps)
            retu+=(cd,)
        if directed_acyclic:
            retu+=(dag,)
        if euler_tour:
            retu+=(et,)
        if linked_components:
            retu+=(lc,)
        if lowlink:
            retu=(ll,)
        if parents:
            retu+=(ps,)
        if postorder:
            retu+=(post,)
        if preorder:
            retu+=(pre,)
        if subtree_size:
            retu+=(ss,)
        if topological_sort:
            if dag:
                tp_sort=post[::-1]
            else:
                tp_sort=[]
            retu+=(tp_sort,)
        if unweighted_dist:
            retu+=(uwd,)
        if weighted_dist:
            retu+=(wd,)
        if len(retu)==1:
            retu=retu[0]
        return retu

    def Route_Restoration(self,s,g,parents):
        route=[g]
        while s!=g:
            if parents[g]==None:
                route=[]
                break
            g=parents[g]
            route.append(g)
        route=route[::-1]
        return route

N,M=map(int,input().split())
UF=UnionFind(N,weighted=True)
edges=[]
idx={}
for m in range(M):
    u,v,w=map(int,input().split())
    u-=1;v-=1
    if UF.Same(u,v):
        if UF.Weight(u,v)!=w:
            G=Graph(N,edges=edges,directed=True,weighted=True)
            parents=G.SIV_DFS(v,parents=True)
            route=G.Route_Restoration(v,u,parents=parents)
            if UF.Weight(u,v)>w:
                u,v=v,u
                route=route[::-1]
                w=-w
            print(len(route))
            print(u+1)
            ans_lst=[m]
            for x,y in zip(route,route[1:]):
                ans_lst.append(idx[(x,y)])
            print(*[m+1 for m in ans_lst])
            exit()
    else:
        UF.Union(u,v,w)
        edges.append((u,v,w))
        edges.append((v,u,w))
        idx[(u,v)]=m
        idx[(v,u)]=m
print(-1)

yukicoder

結果

テストケース

ソースコード