結果
問題 | No.101 ぐるぐる!あみだくじ! |
ユーザー | Navier_Boltzmann |
提出日時 | 2023-06-08 12:22:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 115 ms / 5,000 ms |
コード長 | 1,737 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 86,984 KB |
実行使用メモリ | 77,372 KB |
最終ジャッジ日時 | 2023-08-29 01:45:55 |
合計ジャッジ時間 | 6,384 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 103 ms
72,788 KB |
testcase_01 | AC | 110 ms
73,004 KB |
testcase_02 | AC | 115 ms
73,048 KB |
testcase_03 | AC | 109 ms
77,196 KB |
testcase_04 | AC | 106 ms
72,904 KB |
testcase_05 | AC | 107 ms
73,056 KB |
testcase_06 | AC | 104 ms
72,728 KB |
testcase_07 | AC | 105 ms
72,656 KB |
testcase_08 | AC | 105 ms
72,728 KB |
testcase_09 | AC | 107 ms
72,772 KB |
testcase_10 | AC | 106 ms
72,872 KB |
testcase_11 | AC | 106 ms
72,788 KB |
testcase_12 | AC | 109 ms
77,096 KB |
testcase_13 | AC | 110 ms
72,704 KB |
testcase_14 | AC | 106 ms
72,948 KB |
testcase_15 | AC | 106 ms
72,776 KB |
testcase_16 | AC | 106 ms
73,024 KB |
testcase_17 | AC | 107 ms
72,896 KB |
testcase_18 | AC | 106 ms
73,012 KB |
testcase_19 | AC | 109 ms
77,024 KB |
testcase_20 | AC | 107 ms
72,780 KB |
testcase_21 | AC | 106 ms
72,728 KB |
testcase_22 | AC | 104 ms
73,044 KB |
testcase_23 | AC | 105 ms
72,820 KB |
testcase_24 | AC | 108 ms
77,088 KB |
testcase_25 | AC | 106 ms
72,852 KB |
testcase_26 | AC | 109 ms
76,828 KB |
testcase_27 | AC | 109 ms
77,240 KB |
testcase_28 | AC | 110 ms
77,372 KB |
testcase_29 | AC | 107 ms
76,948 KB |
testcase_30 | AC | 109 ms
77,360 KB |
testcase_31 | AC | 109 ms
77,108 KB |
testcase_32 | AC | 103 ms
72,732 KB |
testcase_33 | AC | 108 ms
77,072 KB |
testcase_34 | AC | 103 ms
72,724 KB |
testcase_35 | AC | 101 ms
73,028 KB |
testcase_36 | AC | 104 ms
72,960 KB |
testcase_37 | AC | 106 ms
77,236 KB |
testcase_38 | AC | 104 ms
76,836 KB |
testcase_39 | AC | 105 ms
77,076 KB |
ソースコード
from collections import * from itertools import * from functools import * from heapq import * import sys,math input = sys.stdin.readline class DSU: def __init__(self, n): self._n = n self.parent_or_size = [-1] * n def merge(self, a, b): assert 0 <= a < self._n assert 0 <= b < self._n x, y = self.leader(a), self.leader(b) if x == y: return x if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x self.parent_or_size[x] += self.parent_or_size[y] self.parent_or_size[y] = x return x def same(self, a, b): assert 0 <= a < self._n assert 0 <= b < self._n return self.leader(a) == self.leader(b) def leader(self, a): assert 0 <= a < self._n if self.parent_or_size[a] < 0: return a self.parent_or_size[a] = self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self, a): assert 0 <= a < self._n return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf = [self.leader(i) for i in range(self._n)] result = [[] for _ in range(self._n)] for i in range(self._n): result[leader_buf[i]].append(i) return [r for r in result if r != []] N = int(input()) K = int(input()) D = DSU(N) X = [i for i in range(N)] for _ in range(K): x,y = map(int,input().split()) x -= 1 y -= 1 X[x],X[y] = X[y],X[x] for i,x in enumerate(X): D.merge(i,x) A = [] for i in range(N): now = i cnt = 1 while X[now]!=i: now = X[now] cnt += 1 A.append(cnt) def lcm(x,y): return x*y//math.gcd(x,y) ans = 1 for a in A: ans = lcm(ans,a) print(ans)