結果
問題 | No.986 Present |
ユーザー | maspy |
提出日時 | 2020-02-13 00:03:03 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 544 ms / 2,000 ms |
コード長 | 1,374 bytes |
コンパイル時間 | 153 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 54,404 KB |
最終ジャッジ日時 | 2024-04-15 01:00:39 |
合計ジャッジ時間 | 18,597 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 513 ms
44,428 KB |
testcase_01 | AC | 508 ms
44,168 KB |
testcase_02 | AC | 504 ms
44,296 KB |
testcase_03 | AC | 523 ms
49,752 KB |
testcase_04 | AC | 496 ms
43,912 KB |
testcase_05 | AC | 507 ms
48,200 KB |
testcase_06 | AC | 514 ms
47,496 KB |
testcase_07 | AC | 494 ms
44,036 KB |
testcase_08 | AC | 505 ms
44,420 KB |
testcase_09 | AC | 536 ms
52,044 KB |
testcase_10 | AC | 494 ms
44,428 KB |
testcase_11 | AC | 515 ms
49,608 KB |
testcase_12 | AC | 512 ms
45,900 KB |
testcase_13 | AC | 491 ms
44,168 KB |
testcase_14 | AC | 499 ms
44,040 KB |
testcase_15 | AC | 534 ms
54,404 KB |
testcase_16 | AC | 507 ms
46,852 KB |
testcase_17 | AC | 523 ms
50,244 KB |
testcase_18 | AC | 527 ms
51,036 KB |
testcase_19 | AC | 523 ms
52,556 KB |
testcase_20 | AC | 503 ms
44,424 KB |
testcase_21 | AC | 540 ms
53,832 KB |
testcase_22 | AC | 535 ms
53,964 KB |
testcase_23 | AC | 510 ms
45,704 KB |
testcase_24 | AC | 544 ms
53,360 KB |
testcase_25 | AC | 511 ms
44,424 KB |
testcase_26 | AC | 536 ms
53,208 KB |
testcase_27 | AC | 529 ms
48,708 KB |
testcase_28 | AC | 530 ms
53,436 KB |
testcase_29 | AC | 521 ms
52,812 KB |
testcase_30 | AC | 498 ms
44,680 KB |
testcase_31 | AC | 520 ms
51,272 KB |
testcase_32 | AC | 522 ms
52,056 KB |
ソースコード
import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines import numpy as np N, M = map(int, read().split()) MOD = 998244353 def cumprod(A, MOD = MOD): L = len(A); Lsq = int(L**.5+1) A = np.resize(A, Lsq**2).reshape(Lsq,Lsq) for n in range(1,Lsq): A[:,n] *= A[:,n-1]; A[:,n] %= MOD for n in range(1,Lsq): A[n] *= A[n-1,-1]; A[n] %= MOD return A.ravel()[:L] def make_fact(U, MOD = MOD): x = np.arange(U, dtype = np.int64); x[0] = 1 fact = cumprod(x, MOD) x = np.arange(U, 0, -1, dtype=np.int64); x[0] = pow(int(fact[-1]), MOD-2, MOD) fact_inv = cumprod(x, MOD)[::-1] fact.flags.writeable = False fact_inv.flags.writeable = False return fact,fact_inv def make_power(a, L, MOD=MOD): B = L.bit_length() x = np.empty((1<<B), np.int64) x[0] = 1 for n in range(B): x[1<<n:1<<(n+1)] = x[:1<<n] * a % MOD a *= a; a %= MOD x = x[:L] x.flags.writeable = False return x pow_2 = make_power(2, M + 10, MOD) answer = [0,0,0] answer[0] = pow_2[N] x = pow_2[M] - pow_2[:N] answer[1] = cumprod(x)[-1] x = pow_2[N] - pow_2[:N] answer[2] = answer[1] * pow(int(cumprod(x)[-1]), MOD-2, MOD) % MOD # 順序対じゃないよ! _, fact_inv = make_fact(M + 10) answer[1] *= fact_inv[N] answer[1] %= MOD print(*answer)