結果
問題 | No.1392 Don't be together |
ユーザー | chineristAC |
提出日時 | 2020-09-01 12:23:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,458 ms / 2,000 ms |
コード長 | 1,633 bytes |
コンパイル時間 | 247 ms |
コンパイル使用メモリ | 82,148 KB |
実行使用メモリ | 277,848 KB |
最終ジャッジ日時 | 2024-05-01 01:28:19 |
合計ジャッジ時間 | 20,288 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
65,708 KB |
testcase_01 | AC | 61 ms
65,140 KB |
testcase_02 | AC | 63 ms
65,196 KB |
testcase_03 | AC | 60 ms
65,872 KB |
testcase_04 | AC | 59 ms
65,488 KB |
testcase_05 | AC | 59 ms
64,420 KB |
testcase_06 | AC | 580 ms
157,784 KB |
testcase_07 | AC | 756 ms
219,488 KB |
testcase_08 | AC | 1,280 ms
204,560 KB |
testcase_09 | AC | 801 ms
277,848 KB |
testcase_10 | AC | 1,021 ms
169,020 KB |
testcase_11 | AC | 1,220 ms
224,396 KB |
testcase_12 | AC | 1,131 ms
159,132 KB |
testcase_13 | AC | 1,126 ms
202,616 KB |
testcase_14 | AC | 967 ms
221,616 KB |
testcase_15 | AC | 732 ms
160,844 KB |
testcase_16 | AC | 1,458 ms
226,876 KB |
testcase_17 | AC | 873 ms
183,060 KB |
testcase_18 | AC | 1,241 ms
201,232 KB |
testcase_19 | AC | 1,043 ms
192,692 KB |
testcase_20 | AC | 386 ms
117,488 KB |
testcase_21 | AC | 180 ms
92,544 KB |
testcase_22 | AC | 763 ms
150,852 KB |
testcase_23 | AC | 517 ms
123,500 KB |
testcase_24 | AC | 302 ms
98,936 KB |
testcase_25 | AC | 655 ms
130,272 KB |
testcase_26 | AC | 194 ms
96,252 KB |
testcase_27 | AC | 409 ms
103,776 KB |
testcase_28 | AC | 599 ms
131,724 KB |
testcase_29 | AC | 377 ms
102,516 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)