結果
問題 |
No.2004 Incremental Coins
|
ユーザー |
![]() |
提出日時 | 2025-06-12 13:49:19 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,410 bytes |
コンパイル時間 | 192 ms |
コンパイル使用メモリ | 82,728 KB |
実行使用メモリ | 140,272 KB |
最終ジャッジ日時 | 2025-06-12 13:49:36 |
合計ジャッジ時間 | 5,197 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
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 = int(data[ptr]) ptr += 1 K = int(data[ptr]) ptr += 1 A = list(map(int, data[ptr:ptr + N+1])) ptr += N+1 P = list(map(int, data[ptr:ptr + N])) ptr += N P = [0] + P # adjusting indices since j starts from 1 in problem statement, but P is 0-based. max_depth = N fact = [1] * (max_depth + 1) for i in range(1, max_depth + 1): fact[i] = fact[i-1] * i % MOD inv_fact = [1] * (max_depth + 1) inv_fact[max_depth] = pow(fact[max_depth], MOD-2, MOD) for i in range(max_depth-1, -1, -1): inv_fact[i] = inv_fact[i+1] * (i+1) % MOD C = [0] * (max_depth + 1) current = 1 C[0] = 1 for d in range(1, max_depth + 1): if d > K: C[d] = 0 else: current = current * (K - d + 1) % MOD C[d] = current * inv_fact[d] % MOD result = [0] * (N+1) for j in range(N+1): current_j = j depth = 0 while True: result[current_j] = (result[current_j] + A[j] * C[depth]) % MOD if current_j == 0: break current_j = P[current_j] depth += 1 if depth > max_depth: break for i in range(N+1): print(result[i] % MOD) if __name__ == "__main__": main()