結果
問題 | No.1392 Don't be together |
ユーザー | chineristAC |
提出日時 | 2020-09-01 12:23:03 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 1,396 ms / 2,000 ms |
コード長 | 1,633 bytes |
コンパイル時間 | 852 ms |
コンパイル使用メモリ | 86,948 KB |
実行使用メモリ | 278,424 KB |
最終ジャッジ日時 | 2023-08-13 07:45:17 |
合計ジャッジ時間 | 19,721 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 85 ms
80,540 KB |
testcase_01 | AC | 86 ms
80,564 KB |
testcase_02 | AC | 85 ms
80,860 KB |
testcase_03 | AC | 86 ms
80,680 KB |
testcase_04 | AC | 85 ms
80,708 KB |
testcase_05 | AC | 87 ms
80,656 KB |
testcase_06 | AC | 524 ms
155,888 KB |
testcase_07 | AC | 612 ms
238,940 KB |
testcase_08 | AC | 1,136 ms
209,920 KB |
testcase_09 | AC | 751 ms
278,424 KB |
testcase_10 | AC | 947 ms
175,352 KB |
testcase_11 | AC | 1,164 ms
230,384 KB |
testcase_12 | AC | 1,048 ms
164,468 KB |
testcase_13 | AC | 1,084 ms
200,912 KB |
testcase_14 | AC | 967 ms
203,184 KB |
testcase_15 | AC | 639 ms
161,136 KB |
testcase_16 | AC | 1,396 ms
222,152 KB |
testcase_17 | AC | 905 ms
168,868 KB |
testcase_18 | AC | 1,151 ms
213,384 KB |
testcase_19 | AC | 1,048 ms
188,772 KB |
testcase_20 | AC | 316 ms
129,224 KB |
testcase_21 | AC | 190 ms
99,860 KB |
testcase_22 | AC | 706 ms
166,444 KB |
testcase_23 | AC | 479 ms
126,244 KB |
testcase_24 | AC | 247 ms
109,900 KB |
testcase_25 | AC | 625 ms
144,052 KB |
testcase_26 | AC | 210 ms
92,956 KB |
testcase_27 | AC | 407 ms
105,984 KB |
testcase_28 | AC | 535 ms
138,724 KB |
testcase_29 | AC | 338 ms
116,560 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 = 2*10**5 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())) assert(2<=N<=5000) assert(2<=M<=N) assert(len(P)==N) assert(all(i+1!=P[i] for i in range(N))) 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) P.sort() assert(all(i==P[i] for i in range(N))) n = len(cycle) binom_poly = [1] for i in range(n): c = [cmb(cycle[i],j,mod)*pow(-1,j,mod) for j in range(1,cycle[i]+1)] c[0] = (c[0] + 1) % mod merged = [0 for i in range(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 = [[int(i==j or i==1) for i in range(M+1)] for j in range(N+1)] Stirling[0][0] = 0 for j in range(2,M+1): for i in range(j+1,N+1): Stirling[i][j] = Stirling[i-1][j-1] + j * Stirling[i-1][j] Stirling[i][j] %= mod ans = 0 for i in range(N-n+1): ans += Stirling[n+i][M] * binom_poly[i] ans %= mod ans *= (-1)**N ans %= mod print(ans)