結果
問題 | No.1239 Multiplication -2 |
ユーザー | phspls |
提出日時 | 2022-11-19 15:03:37 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 1,861 bytes |
コンパイル時間 | 3,615 ms |
コンパイル使用メモリ | 176,172 KB |
実行使用メモリ | 22,792 KB |
最終ジャッジ日時 | 2023-10-20 19:41:15 |
合計ジャッジ時間 | 6,383 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 1 ms
4,348 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 1 ms
4,348 KB |
testcase_09 | AC | 1 ms
4,348 KB |
testcase_10 | AC | 1 ms
4,348 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 1 ms
4,348 KB |
testcase_13 | AC | 1 ms
4,348 KB |
testcase_14 | AC | 1 ms
4,348 KB |
testcase_15 | AC | 15 ms
8,312 KB |
testcase_16 | AC | 24 ms
12,820 KB |
testcase_17 | AC | 40 ms
22,644 KB |
testcase_18 | AC | 39 ms
22,644 KB |
testcase_19 | AC | 39 ms
22,672 KB |
testcase_20 | AC | 41 ms
22,792 KB |
testcase_21 | AC | 39 ms
22,176 KB |
testcase_22 | AC | 38 ms
21,104 KB |
testcase_23 | AC | 29 ms
16,396 KB |
testcase_24 | AC | 29 ms
15,828 KB |
testcase_25 | AC | 24 ms
13,856 KB |
testcase_26 | AC | 26 ms
14,848 KB |
testcase_27 | AC | 13 ms
7,228 KB |
testcase_28 | AC | 36 ms
19,568 KB |
testcase_29 | AC | 40 ms
21,188 KB |
testcase_30 | AC | 18 ms
9,932 KB |
testcase_31 | AC | 26 ms
13,976 KB |
testcase_32 | AC | 43 ms
22,464 KB |
testcase_33 | AC | 31 ms
16,052 KB |
testcase_34 | AC | 28 ms
15,056 KB |
testcase_35 | AC | 15 ms
8,320 KB |
testcase_36 | AC | 14 ms
7,776 KB |
ソースコード
const OFFSET: usize = 2; const MOD: usize = 998244353; fn power(base: usize, times: usize) -> usize { if times == 0 { return 1usize; } if times == 1 { return base; } let temp = power(base, times/2); temp * temp % MOD * power(base, times%2) % MOD } fn main() { let mut n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n: usize = n.trim().parse().unwrap(); let mut a = String::new(); std::io::stdin().read_line(&mut a).ok(); let a: Vec<isize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let mut p2s = vec![1usize; n]; for i in (1..n-1).rev() { p2s[i-1] = p2s[i] * 2 % MOD; } let mut dp = vec![vec![0usize; 6]; n+1]; dp[0][OFFSET+1] = 1; let mut result = 0usize; for i in 0..n { for j in -2..=3 { let jidx = OFFSET as isize + j; let jidx = jidx as usize; if a[i].abs() * j.abs() > 2 { dp[i+1][5] += dp[i][jidx]; dp[i+1][5] %= MOD; continue; } let njidx = OFFSET as isize + a[i] * j; let njidx = njidx as usize; dp[i+1][njidx] += dp[i][jidx]; dp[i+1][njidx] %= MOD; if njidx == 0 { result += dp[i][jidx] * p2s[i]; result %= MOD; } } if i == 0 { continue; } for j in -2..=3 { let jidx = OFFSET as isize + j; let jidx = jidx as usize; let njidx = OFFSET as isize + a[i]; let njidx = njidx as usize; dp[i+1][njidx] += dp[i][jidx]; dp[i+1][njidx] %= MOD; if njidx == 0 { result += dp[i][jidx] * p2s[i]; result %= MOD; } } } println!("{}", result * power(power(2, MOD-2), n-1) % MOD); }