結果
問題 | No.1856 Mex Sum 2 |
ユーザー | 👑 cologne |
提出日時 | 2022-02-28 18:00:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,759 ms / 3,000 ms |
コード長 | 904 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 77,944 KB |
最終ジャッジ日時 | 2023-09-21 02:30:40 |
合計ジャッジ時間 | 48,386 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,160 KB |
testcase_01 | AC | 74 ms
71,132 KB |
testcase_02 | AC | 97 ms
76,412 KB |
testcase_03 | AC | 75 ms
71,396 KB |
testcase_04 | AC | 74 ms
71,356 KB |
testcase_05 | AC | 74 ms
71,352 KB |
testcase_06 | AC | 73 ms
71,392 KB |
testcase_07 | AC | 90 ms
76,352 KB |
testcase_08 | AC | 74 ms
71,272 KB |
testcase_09 | AC | 72 ms
71,588 KB |
testcase_10 | AC | 73 ms
71,272 KB |
testcase_11 | AC | 74 ms
71,380 KB |
testcase_12 | AC | 75 ms
71,472 KB |
testcase_13 | AC | 73 ms
71,296 KB |
testcase_14 | AC | 71 ms
71,540 KB |
testcase_15 | AC | 74 ms
71,140 KB |
testcase_16 | AC | 77 ms
75,164 KB |
testcase_17 | AC | 90 ms
76,548 KB |
testcase_18 | AC | 88 ms
76,108 KB |
testcase_19 | AC | 76 ms
75,548 KB |
testcase_20 | AC | 76 ms
75,196 KB |
testcase_21 | AC | 72 ms
71,276 KB |
testcase_22 | AC | 92 ms
76,464 KB |
testcase_23 | AC | 75 ms
71,416 KB |
testcase_24 | AC | 91 ms
76,136 KB |
testcase_25 | AC | 92 ms
76,496 KB |
testcase_26 | AC | 75 ms
71,388 KB |
testcase_27 | AC | 74 ms
71,268 KB |
testcase_28 | AC | 75 ms
71,456 KB |
testcase_29 | AC | 203 ms
77,700 KB |
testcase_30 | AC | 140 ms
77,776 KB |
testcase_31 | AC | 195 ms
77,516 KB |
testcase_32 | AC | 307 ms
77,600 KB |
testcase_33 | AC | 325 ms
77,680 KB |
testcase_34 | AC | 193 ms
77,600 KB |
testcase_35 | AC | 140 ms
77,380 KB |
testcase_36 | AC | 115 ms
77,668 KB |
testcase_37 | AC | 195 ms
77,624 KB |
testcase_38 | AC | 105 ms
77,668 KB |
testcase_39 | AC | 96 ms
76,488 KB |
testcase_40 | AC | 95 ms
76,608 KB |
testcase_41 | AC | 93 ms
76,992 KB |
testcase_42 | AC | 1,635 ms
77,592 KB |
testcase_43 | AC | 1,326 ms
77,544 KB |
testcase_44 | AC | 1,445 ms
77,944 KB |
testcase_45 | AC | 1,610 ms
77,284 KB |
testcase_46 | AC | 1,332 ms
77,508 KB |
testcase_47 | AC | 1,475 ms
77,744 KB |
testcase_48 | AC | 1,667 ms
77,700 KB |
testcase_49 | AC | 1,654 ms
77,716 KB |
testcase_50 | AC | 1,103 ms
77,268 KB |
testcase_51 | AC | 1,736 ms
77,488 KB |
testcase_52 | AC | 1,716 ms
77,552 KB |
testcase_53 | AC | 1,739 ms
77,552 KB |
testcase_54 | AC | 1,759 ms
77,580 KB |
testcase_55 | AC | 1,740 ms
77,284 KB |
testcase_56 | AC | 1,748 ms
77,288 KB |
testcase_57 | AC | 1,746 ms
77,548 KB |
testcase_58 | AC | 1,746 ms
77,544 KB |
testcase_59 | AC | 1,741 ms
77,516 KB |
testcase_60 | AC | 1,740 ms
77,420 KB |
testcase_61 | AC | 1,751 ms
77,808 KB |
testcase_62 | AC | 1,746 ms
77,396 KB |
testcase_63 | AC | 1,735 ms
77,424 KB |
testcase_64 | AC | 1,745 ms
77,296 KB |
testcase_65 | AC | 1,736 ms
77,300 KB |
testcase_66 | AC | 1,737 ms
77,644 KB |
ソースコード
def main(): MOD = 998244353 N, M = map(int, input().split()) f = [0] * (min(N, M+1) + 1) DP = [1] + [0] * min(N, M+1) C = 1 for iter in range(1, N+1): C = C * (N-iter+1) * pow(iter, -1, MOD) % MOD mult = pow(M+1, N-iter, MOD) * C % MOD for i in range(min(N, M+1), -1, -1): DP[i] = ( i * DP[i] + (DP[i-1] if i != 0 else 0) ) % MOD f = [(f[i] + mult * DP[i]) % MOD for i in range(min(N, M+1)+1)] ans = 0 for mex in range(1, min(N, M+1)+1): mult = 1 for j in range(1, mex): mult = mult * j % MOD for i in range(mex, min(N, M+1)+1): mult = mult * i % MOD if i != mex: mult = mult * (M-i+1) * pow(i-mex, -1, MOD) % MOD ans = (ans + mex * mult * f[i]) % MOD print(ans) if __name__ == '__main__': main()