結果

問題 No.2428 Returning Shuffle
ユーザー sotanishysotanishy
提出日時 2023-08-18 21:50:57
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 759 ms / 2,000 ms
コード長 1,229 bytes
コンパイル時間 255 ms
コンパイル使用メモリ 81,996 KB
実行使用メモリ 268,692 KB
最終ジャッジ日時 2024-11-28 06:37:26
合計ジャッジ時間 6,715 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from collections import defaultdict
import sys
input = sys.stdin.readline
def prime_factor(n):
factors = {}
if n % 2 == 0:
cnt = 0
while n % 2 == 0:
cnt += 1
n //= 2
factors[2] = cnt
i = 3
while i * i <= n:
if n % i == 0:
cnt = 0
while n % i == 0:
cnt += 1
n //= i
factors[i] = cnt
i += 2
if n != 1:
factors[n] = 1
return factors
mod = 998244353
N, M = map(int, input().split())
P = list(range(N))
Q = list(range(N))
for _ in range(M):
T, *S = map(int, input().split())
S = list(map(lambda x: x-1, S))
tmp = Q[P[S[0]]]
x = [P[S[0]]]
for i in range(T-1):
Q[P[S[i]]] = Q[P[S[i+1]]]
x.append(P[S[i+1]])
Q[P[S[T-1]]] = tmp
for i in x:
P[Q[i]] = i
visited = [0] * N
exp = defaultdict(int)
for i in P:
if visited[i]:
continue
j = P[i]
cnt = 1
visited[j] = 1
while j != i:
j = P[j]
cnt += 1
visited[j] = 1
for p, c in prime_factor(cnt).items():
exp[p] = max(exp[p], c)
ans = 1
for p, e in exp.items():
ans = ans * pow(p, e, mod) % mod
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0