結果
問題 | No.1023 Cyclic Tour |
ユーザー | mkawa2 |
提出日時 | 2021-04-09 13:20:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 436 ms / 2,000 ms |
コード長 | 2,664 bytes |
コンパイル時間 | 509 ms |
コンパイル使用メモリ | 87,176 KB |
実行使用メモリ | 133,684 KB |
最終ジャッジ日時 | 2023-09-07 01:59:17 |
合計ジャッジ時間 | 26,567 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 89 ms
71,928 KB |
testcase_01 | AC | 89 ms
72,008 KB |
testcase_02 | AC | 88 ms
71,740 KB |
testcase_03 | AC | 88 ms
71,784 KB |
testcase_04 | AC | 323 ms
93,588 KB |
testcase_05 | AC | 342 ms
92,604 KB |
testcase_06 | AC | 357 ms
95,036 KB |
testcase_07 | AC | 361 ms
93,096 KB |
testcase_08 | AC | 313 ms
109,564 KB |
testcase_09 | AC | 357 ms
113,720 KB |
testcase_10 | AC | 308 ms
114,636 KB |
testcase_11 | AC | 355 ms
115,452 KB |
testcase_12 | AC | 349 ms
121,968 KB |
testcase_13 | AC | 409 ms
120,804 KB |
testcase_14 | AC | 291 ms
119,944 KB |
testcase_15 | AC | 338 ms
121,276 KB |
testcase_16 | AC | 350 ms
121,784 KB |
testcase_17 | AC | 352 ms
120,616 KB |
testcase_18 | AC | 354 ms
122,256 KB |
testcase_19 | AC | 333 ms
119,736 KB |
testcase_20 | AC | 426 ms
91,468 KB |
testcase_21 | AC | 436 ms
90,932 KB |
testcase_22 | AC | 393 ms
104,728 KB |
testcase_23 | AC | 402 ms
106,500 KB |
testcase_24 | AC | 428 ms
119,084 KB |
testcase_25 | AC | 425 ms
90,936 KB |
testcase_26 | AC | 400 ms
89,772 KB |
testcase_27 | AC | 396 ms
89,920 KB |
testcase_28 | AC | 399 ms
115,100 KB |
testcase_29 | AC | 357 ms
121,964 KB |
testcase_30 | AC | 370 ms
115,036 KB |
testcase_31 | AC | 355 ms
107,168 KB |
testcase_32 | AC | 383 ms
117,356 KB |
testcase_33 | AC | 384 ms
113,588 KB |
testcase_34 | AC | 326 ms
90,384 KB |
testcase_35 | AC | 401 ms
90,892 KB |
testcase_36 | AC | 399 ms
93,068 KB |
testcase_37 | AC | 398 ms
107,740 KB |
testcase_38 | AC | 349 ms
112,852 KB |
testcase_39 | AC | 433 ms
105,928 KB |
testcase_40 | AC | 395 ms
103,988 KB |
testcase_41 | AC | 388 ms
103,600 KB |
testcase_42 | AC | 430 ms
90,604 KB |
testcase_43 | AC | 393 ms
118,988 KB |
testcase_44 | AC | 325 ms
87,080 KB |
testcase_45 | AC | 341 ms
133,272 KB |
testcase_46 | AC | 339 ms
133,684 KB |
testcase_47 | AC | 180 ms
91,492 KB |
testcase_48 | AC | 289 ms
99,264 KB |
testcase_49 | AC | 265 ms
95,944 KB |
testcase_50 | AC | 264 ms
98,276 KB |
testcase_51 | AC | 270 ms
98,244 KB |
testcase_52 | AC | 259 ms
98,072 KB |
ソースコード
import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] dij = [(0, 1), (1, 0), (1, 1), (1, -1)] inf = 10**19 # md = 998244353 md = 10**9+7 class UnionFind: def __init__(self, n): self.state = [-1]*n self.size_table = [1]*n # cntはグループ数 self.cnt = n def root(self, u): v = self.state[u] if v < 0: return u self.state[u] = res = self.root(v) return res def merge(self, u, v): ru = self.root(u) rv = self.root(v) if ru == rv: return du = self.state[ru] dv = self.state[rv] if du > dv: ru, rv = rv, ru if du == dv: self.state[ru] -= 1 self.state[rv] = ru self.cnt -= 1 self.size_table[ru] += self.size_table[rv] return # グループの要素数 def size(self, u): return self.size_table[self.root(u)] from collections import defaultdict n, m = LI() uf = UnionFind(n) to = [[] for _ in range(n)] deg = [0]*n for _ in range(m): u, v, c = LI1() if c: to[u].append(v) else: uf.merge(u, v) deg[u] += 1 deg[v] += 1 rtou = defaultdict(list) for u in range(n): r = uf.root(u) rtou[r].append(u) gtou = list(rtou.values()) utog = [0]*n for g, uu in enumerate(gtou): e = 0 for u in uu: utog[u] = g e += deg[u] if e//2 > len(uu)-1: print("Yes") exit() gn = len(gtou) to2 = [set() for _ in range(gn)] for u in range(n): g = utog[u] for v in to[u]: to2[g].add(utog[v]) def dfs(g): stack = [g] while stack: g = stack.pop() if fin[g] == -1: fin[g] = 0 stack.append(g) for v in to2[g]: if fin[v] == -1: stack.append(v) elif fin[v] == 0: return True elif fin[g] == 0: fin[g] = 1 return False fin = [-1]*gn for g in range(gn): if fin[g] == -1 and dfs(g): print("Yes") exit() print("No")