結果

問題 No.1023 Cyclic Tour
ユーザー vwxyzvwxyz
提出日時 2024-07-17 04:25:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 513 ms / 2,000 ms
コード長 5,961 bytes
コンパイル時間 238 ms
コンパイル使用メモリ 82,428 KB
実行使用メモリ 122,908 KB
最終ジャッジ日時 2024-07-17 04:25:33
合計ジャッジ時間 20,965 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
55,892 KB
testcase_01 AC 43 ms
55,496 KB
testcase_02 AC 41 ms
55,696 KB
testcase_03 AC 41 ms
55,080 KB
testcase_04 AC 320 ms
97,444 KB
testcase_05 AC 335 ms
101,464 KB
testcase_06 AC 329 ms
98,744 KB
testcase_07 AC 317 ms
98,116 KB
testcase_08 AC 310 ms
97,692 KB
testcase_09 AC 317 ms
98,540 KB
testcase_10 AC 313 ms
103,448 KB
testcase_11 AC 340 ms
97,312 KB
testcase_12 AC 263 ms
100,292 KB
testcase_13 AC 260 ms
100,332 KB
testcase_14 AC 261 ms
100,516 KB
testcase_15 AC 273 ms
99,336 KB
testcase_16 AC 333 ms
114,204 KB
testcase_17 AC 356 ms
111,388 KB
testcase_18 AC 356 ms
119,100 KB
testcase_19 AC 349 ms
111,864 KB
testcase_20 AC 454 ms
106,876 KB
testcase_21 AC 478 ms
106,732 KB
testcase_22 AC 429 ms
108,080 KB
testcase_23 AC 430 ms
108,772 KB
testcase_24 AC 388 ms
115,884 KB
testcase_25 AC 473 ms
105,824 KB
testcase_26 AC 467 ms
106,496 KB
testcase_27 AC 452 ms
107,200 KB
testcase_28 AC 383 ms
116,432 KB
testcase_29 AC 350 ms
111,656 KB
testcase_30 AC 404 ms
118,160 KB
testcase_31 AC 380 ms
106,956 KB
testcase_32 AC 358 ms
107,600 KB
testcase_33 AC 395 ms
108,168 KB
testcase_34 AC 492 ms
106,696 KB
testcase_35 AC 513 ms
107,428 KB
testcase_36 AC 489 ms
113,592 KB
testcase_37 AC 428 ms
113,668 KB
testcase_38 AC 349 ms
107,052 KB
testcase_39 AC 427 ms
108,164 KB
testcase_40 AC 427 ms
109,340 KB
testcase_41 AC 451 ms
108,944 KB
testcase_42 AC 474 ms
113,724 KB
testcase_43 AC 405 ms
108,984 KB
testcase_44 AC 304 ms
97,604 KB
testcase_45 AC 238 ms
122,908 KB
testcase_46 AC 206 ms
116,756 KB
testcase_47 AC 255 ms
97,556 KB
testcase_48 AC 346 ms
116,368 KB
testcase_49 AC 342 ms
105,724 KB
testcase_50 AC 316 ms
105,852 KB
testcase_51 AC 343 ms
116,968 KB
testcase_52 AC 373 ms
118,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

N,M=map(int,input().split())
AB=[[],[]]
for m in range(M):
    a,b,c=map(int,input().split())
    a-=1;b-=1;c-=1
    AB[c].append((a,b))
UF=UnionFind(N)
ans="No"
for a,b in AB[0]:
    if UF.Same(a,b):
        ans="Yes"
    UF.Union(a,b)
edges=[]
for a,b in AB[1]:
    a=UF.Find(a)
    b=UF.Find(b)
    if a==b:
        ans="Yes"
    edges.append((a,b))
scc=SCC(N,edges=edges)
for lc in scc:
    if len(lc)>=2:
        ans="Yes"
print(ans)
0