結果

問題 No.2428 Returning Shuffle
ユーザー tassei903tassei903
提出日時 2023-08-15 05:42:34
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 766 ms / 2,000 ms
コード長 2,618 bytes
コンパイル時間 325 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 272,164 KB
最終ジャッジ日時 2024-05-03 00:17:43
合計ジャッジ時間 7,757 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 252 ms
121,264 KB
testcase_01 AC 766 ms
145,028 KB
testcase_02 AC 742 ms
143,896 KB
testcase_03 AC 108 ms
97,260 KB
testcase_04 AC 106 ms
96,896 KB
testcase_05 AC 104 ms
97,024 KB
testcase_06 AC 104 ms
97,280 KB
testcase_07 AC 105 ms
96,896 KB
testcase_08 AC 107 ms
96,896 KB
testcase_09 AC 116 ms
97,280 KB
testcase_10 AC 108 ms
97,280 KB
testcase_11 AC 113 ms
96,752 KB
testcase_12 AC 103 ms
97,280 KB
testcase_13 AC 106 ms
97,024 KB
testcase_14 AC 105 ms
96,896 KB
testcase_15 AC 105 ms
97,332 KB
testcase_16 AC 103 ms
97,280 KB
testcase_17 AC 106 ms
97,280 KB
testcase_18 AC 109 ms
96,768 KB
testcase_19 AC 508 ms
139,848 KB
testcase_20 AC 533 ms
145,916 KB
testcase_21 AC 107 ms
97,024 KB
testcase_22 AC 110 ms
97,280 KB
testcase_23 AC 120 ms
96,768 KB
testcase_24 AC 603 ms
272,164 KB
testcase_25 AC 584 ms
272,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
from collections import defaultdict
 
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
 
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
 
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
 
        if x == y:
            return
 
        if self.parents[x] > self.parents[y]:
            x, y = y, x
 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
 
    def size(self, x):
        return -self.parents[self.find(x)]
 
    def same(self, x, y):
        return self.find(x) == self.find(y)
 
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
 
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
 
    def group_count(self):
        return len(self.roots())
 
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
 
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
p = []
pmax = 2000000
a = [-1]*(pmax+1)
for i in range(2,pmax+1):
    if a[i]==-1:
        p.append(i)
        for j in range(i,pmax+1,i):
            a[j] = i
plen = len(p)

def g(x):
    r = []
    while x > 1:
        y = a[x]
        c  = 0
        while x % y == 0:
            c += 1
            x //= y
        r.append((y, c))
    return r

n, m = na()
p = [i for i in range(n)]
pinv = [i for i in range(n)]

for _ in range(m):
    t, *s = na()
    s = [i-1 for i in s]
    for j in range(t-1):
        p[pinv[s[j]]] = s[j+1]
    p[pinv[s[t-1]]] = s[0]

    tmp = pinv[s[t-1]]
    for j in range(t-2,-1,-1):
        pinv[s[j+1]] = pinv[s[j]]
    pinv[s[0]] = tmp

uf = UnionFind(n)
for i in range(n):
    uf.union(i, p[i])


ans = 1
mod = 998244353
f = [0] * plen
for i in uf.roots():
    d = g(uf.size(i))
    for i, j in d:
        f[i] = max(f[i], j)

for i in range(plen):
    if f[i]:
        ans *= pow(i, f[i], mod)
        ans %= mod
print(ans)
0