結果
問題 |
No.2004 Incremental Coins
|
ユーザー |
![]() |
提出日時 | 2025-04-09 20:56:08 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,848 bytes |
コンパイル時間 | 270 ms |
コンパイル使用メモリ | 82,716 KB |
実行使用メモリ | 140,092 KB |
最終ジャッジ日時 | 2025-04-09 20:56:25 |
合計ジャッジ時間 | 4,925 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 6 TLE * 1 -- * 13 |
ソースコード
MOD = 998244353 def main(): import sys input = sys.stdin.read data = input().split() ptr = 0 N, K = int(data[ptr]), int(data[ptr+1]) ptr +=2 A = list(map(int, data[ptr:ptr+N+1])) ptr +=N+1 P = list(map(int, data[ptr:ptr+N])) # Build parent array. parents[j] for j in 0..N (node 0 has parent -1) parents = [-1]*(N+1) for j in range(1, N+1): parents[j] = P[j-1] # since P_j is 0-based in input max_d = N # Precompute factorials and inverse factorials fact = [1]*(max_d+1) for i in range(1, max_d+1): fact[i] = fact[i-1] * i % MOD inv_fact = [1]*(max_d+1) inv_fact[max_d] = pow(fact[max_d], MOD-2, MOD) for i in range(max_d-1, -1, -1): inv_fact[i] = inv_fact[i+1] * (i+1) % MOD # Precompute c[d] = C(K, d) c = [0]*(max_d+1) c[0] = 1 if K == 0: for d in range(1, max_d+1): c[d] = 0 else: K_mod = K % MOD current_prod = 1 for d in range(1, max_d+1): if K < d: current_prod = 0 c[d] = 0 else: term = (K_mod - (d-1)) % MOD if term < 0: term += MOD current_prod = current_prod * term % MOD c_val = current_prod * inv_fact[d] % MOD c[d] = c_val res = [0]*(N+1) for j in range(N+1): current = j d = 0 while current != -1 and d <= K: if d > max_d: break if K >= d: contrib = A[j] * c[d] % MOD res[current] = (res[current] + contrib) % MOD current = parents[current] d += 1 for i in range(N+1): print(res[i] % MOD) if __name__ == '__main__': main()