結果
問題 | No.1392 Don't be together |
ユーザー | mkawa2 |
提出日時 | 2023-05-25 21:01:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 453 ms / 2,000 ms |
コード長 | 2,285 bytes |
コンパイル時間 | 1,607 ms |
コンパイル使用メモリ | 87,096 KB |
実行使用メモリ | 93,060 KB |
最終ジャッジ日時 | 2023-08-25 23:36:50 |
合計ジャッジ時間 | 10,323 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
91,364 KB |
testcase_01 | AC | 92 ms
91,420 KB |
testcase_02 | AC | 92 ms
91,252 KB |
testcase_03 | AC | 92 ms
91,288 KB |
testcase_04 | AC | 92 ms
91,324 KB |
testcase_05 | AC | 92 ms
91,288 KB |
testcase_06 | AC | 260 ms
92,940 KB |
testcase_07 | AC | 216 ms
92,604 KB |
testcase_08 | AC | 316 ms
92,944 KB |
testcase_09 | AC | 367 ms
93,060 KB |
testcase_10 | AC | 335 ms
92,484 KB |
testcase_11 | AC | 453 ms
92,556 KB |
testcase_12 | AC | 317 ms
92,548 KB |
testcase_13 | AC | 360 ms
92,588 KB |
testcase_14 | AC | 366 ms
92,372 KB |
testcase_15 | AC | 311 ms
92,520 KB |
testcase_16 | AC | 430 ms
92,532 KB |
testcase_17 | AC | 268 ms
92,556 KB |
testcase_18 | AC | 360 ms
92,600 KB |
testcase_19 | AC | 285 ms
92,492 KB |
testcase_20 | AC | 296 ms
92,700 KB |
testcase_21 | AC | 245 ms
92,408 KB |
testcase_22 | AC | 294 ms
92,552 KB |
testcase_23 | AC | 264 ms
92,404 KB |
testcase_24 | AC | 233 ms
92,476 KB |
testcase_25 | AC | 317 ms
92,404 KB |
testcase_26 | AC | 250 ms
92,484 KB |
testcase_27 | AC | 251 ms
92,552 KB |
testcase_28 | AC | 318 ms
92,368 KB |
testcase_29 | AC | 310 ms
92,412 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # 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)] inf = (1 << 63)-1 # md = 10**9+7 md = 998244353 def nCr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md n_max = 200005 fac = [1] for i in range(1, n_max+1): fac.append(fac[-1]*i%md) ifac = [1]*(n_max+1) ifac[n_max] = pow(fac[n_max], md-2, md) for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md def size(i): res = 0 while fin[i] == 0: fin[i] = 1 res += 1 i = pp[i] return res def dot(aa, bb): h = len(aa) w = len(bb[0]) res = [[0]*w for _ in range(h)] for j, col in enumerate(zip(*bb)): for i in range(h): v = 0 # for a, b in zip(row, col): v += a*b # res[i][j] = v for a, b in zip(aa[i], col): v += a*b%md res[i][j] = v%md return res def matpow(mat, e0): if e0 in memo: return memo[e0] e=e0 n = len(mat) res = [[1 if i == j else 0 for j in range(n)] for i in range(n)] while e: if e & 1: res = dot(res, mat) mat = dot(mat, mat) e >>= 1 memo[e0] = res return res n, m = LI() pp = LI1() ss = [] fin = [0]*n for i in range(n): if fin[i]: continue ss.append(size(i)) # pDB(ss) ans = 0 # du=disuse for du in range(m-1): c = m-du mat = [[0, c-1], [1, c-2]] cur = 1 memo = {} for s in ss: cur *= matpow(mat, s)[0][0]*c%md cur %= md cur = cur*nCr(m, du)%md if du & 1: ans -= cur else: ans += cur ans %= md ans *= ifac[m] print(ans%md)