結果
問題 | No.1392 Don't be together |
ユーザー | chineristAC |
提出日時 | 2020-09-02 23:55:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 564 ms / 2,000 ms |
コード長 | 1,531 bytes |
コンパイル時間 | 406 ms |
コンパイル使用メモリ | 82,180 KB |
実行使用メモリ | 273,152 KB |
最終ジャッジ日時 | 2024-05-01 19:57:33 |
合計ジャッジ時間 | 9,848 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
59,008 KB |
testcase_01 | AC | 47 ms
59,008 KB |
testcase_02 | AC | 48 ms
58,624 KB |
testcase_03 | AC | 48 ms
58,752 KB |
testcase_04 | AC | 47 ms
58,880 KB |
testcase_05 | AC | 47 ms
59,136 KB |
testcase_06 | AC | 387 ms
157,056 KB |
testcase_07 | AC | 390 ms
218,496 KB |
testcase_08 | AC | 508 ms
206,508 KB |
testcase_09 | AC | 564 ms
273,152 KB |
testcase_10 | AC | 348 ms
168,112 KB |
testcase_11 | AC | 423 ms
211,140 KB |
testcase_12 | AC | 343 ms
164,512 KB |
testcase_13 | AC | 388 ms
189,864 KB |
testcase_14 | AC | 402 ms
214,624 KB |
testcase_15 | AC | 304 ms
168,984 KB |
testcase_16 | AC | 455 ms
214,044 KB |
testcase_17 | AC | 342 ms
168,640 KB |
testcase_18 | AC | 414 ms
211,580 KB |
testcase_19 | AC | 371 ms
191,372 KB |
testcase_20 | AC | 186 ms
124,784 KB |
testcase_21 | AC | 108 ms
84,032 KB |
testcase_22 | AC | 291 ms
145,128 KB |
testcase_23 | AC | 211 ms
125,320 KB |
testcase_24 | AC | 152 ms
102,680 KB |
testcase_25 | AC | 227 ms
124,704 KB |
testcase_26 | AC | 105 ms
83,504 KB |
testcase_27 | AC | 144 ms
82,304 KB |
testcase_28 | AC | 217 ms
124,764 KB |
testcase_29 | AC | 150 ms
103,832 KB |
ソースコード
def cmb(n, r, mod): if ( r<0 or r>n ): return 0 r = min(r, n-r) return g1[n] * g2[r] * g2[n-r] % mod mod = 998244353 N = 5000 g1 = [1]*(N+1) g2 = [1]*(N+1) inverse = [1]*(N+1) for i in range( 2, N + 1 ): g1[i]=( ( g1[i-1] * i ) % mod ) inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod ) g2[i]=( (g2[i-1] * inverse[i]) % mod ) inverse[0]=0 N,M = map(int,input().split()) P = list(map(int,input().split())) P = [P[i]-1 for i in range(N)] cycle = [] used = [False]*N for i in range(N): if not used[i]: used[i] = True c = 1 pos = i while not used[P[pos]]: pos = P[pos] used[pos] = True c += 1 cycle.append(c) n = len(cycle) binom_poly = [1] for i in range(n): c = [cmb(cycle[i],j,mod) for j in range(1,cycle[i]+1)] for j in range(0,cycle[i],2): c[j] = (- c[j]) % mod c[0] = (c[0] + 1) % mod merged = [0]*(len(binom_poly) + len(c) - 1) for i in range(len(binom_poly)): for j in range(len(c)): merged[i+j] += binom_poly[i] * c[j] merged[i+j] %= mod binom_poly = merged Stirling = [[0 for j in range(N+1)] for i in range(M+1)] for j in range(1,N+1): Stirling[1][j] = 1 for i in range(2,M+1): for j in range(i,N+1): Stirling[i][j] = Stirling[i-1][j-1] + i * Stirling[i][j-1] Stirling[i][j] %= mod ans = 0 for i in range(N-n+1): ans += Stirling[M][n+i] * binom_poly[i] ans %= mod ans *= (-1)**N ans %= mod print(ans)