結果
問題 | No.1325 Subsequence Score |
ユーザー | Yukino DX. |
提出日時 | 2024-09-26 22:15:38 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 133 ms / 2,000 ms |
コード長 | 3,573 bytes |
コンパイル時間 | 15,570 ms |
コンパイル使用メモリ | 378,392 KB |
実行使用メモリ | 14,616 KB |
最終ジャッジ日時 | 2024-09-26 22:15:57 |
合計ジャッジ時間 | 19,094 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 133 ms
14,336 KB |
testcase_14 | AC | 11 ms
5,376 KB |
testcase_15 | AC | 31 ms
12,416 KB |
testcase_16 | AC | 34 ms
13,696 KB |
testcase_17 | AC | 15 ms
7,168 KB |
testcase_18 | AC | 9 ms
5,376 KB |
testcase_19 | AC | 35 ms
14,464 KB |
testcase_20 | AC | 6 ms
5,376 KB |
testcase_21 | AC | 13 ms
6,272 KB |
testcase_22 | AC | 16 ms
7,296 KB |
testcase_23 | AC | 36 ms
14,592 KB |
testcase_24 | AC | 36 ms
14,616 KB |
testcase_25 | AC | 35 ms
14,512 KB |
testcase_26 | AC | 36 ms
14,420 KB |
testcase_27 | AC | 36 ms
14,588 KB |
testcase_28 | AC | 1 ms
5,376 KB |
testcase_29 | AC | 1 ms
5,376 KB |
testcase_30 | AC | 1 ms
5,376 KB |
ソースコード
use proconio::input; fn main() { input! { n:usize, a:[usize;n], } let mut dp = vec![ModInt::<MOD>::new(0); n + 1]; let mut pow2 = ModInt::new(1); let two = ModInt::new(2); for i in 1..=n { if i == 1 { dp[i] = dp[i - 1] * two + ModInt::new(a[i - 1]); } else { dp[i] = dp[i - 1] * two + pow2 * ModInt::new((i + 1) * a[i - 1]); pow2 *= two; } } let ans = dp[n]; println!("{}", ans); } const MOD: usize = 998244353; use modint::*; mod modint { use std::fmt; use std::ops; #[derive(Copy, Clone, PartialEq, Eq)] pub struct ModInt<const MOD: usize> { pub val: usize, } impl<const MOD: usize> ModInt<MOD> { pub fn new(val: usize) -> Self { Self { val: val % MOD } } pub fn pow(mut self, mut e: usize) -> Self { let mut res = Self::new(1); while 0 < e { if e & 1 != 0 { res *= self; } self *= self; e >>= 1; } res } } impl<const MOD: usize> From<usize> for ModInt<MOD> { fn from(value: usize) -> Self { Self { val: value % MOD } } } impl<const MOD: usize> fmt::Display for ModInt<MOD> { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f, "{}", self.val) } } impl<const MOD: usize> fmt::Debug for ModInt<MOD> { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f, "{}", self.val) } } impl<const MOD: usize> ops::Neg for ModInt<MOD> { type Output = Self; fn neg(self) -> Self::Output { Self { val: (MOD - self.val) % MOD, } } } impl<const MOD: usize> ops::Add for ModInt<MOD> { type Output = Self; fn add(self, rhs: Self) -> Self::Output { Self { val: (self.val + rhs.val) % MOD, } } } impl<const MOD: usize> ops::AddAssign for ModInt<MOD> { fn add_assign(&mut self, rhs: Self) { *self = *self + rhs; } } impl<const MOD: usize> ops::Mul for ModInt<MOD> { type Output = Self; fn mul(self, rhs: Self) -> Self::Output { Self { val: self.val * rhs.val % MOD, } } } impl<const MOD: usize> ops::MulAssign for ModInt<MOD> { fn mul_assign(&mut self, rhs: Self) { *self = *self * rhs; } } impl<const MOD: usize> ops::Sub for ModInt<MOD> { type Output = Self; fn sub(mut self, rhs: Self) -> Self::Output { if self.val < rhs.val { self.val += MOD; } Self { val: (self.val - rhs.val) % MOD, } } } impl<const MOD: usize> ops::SubAssign for ModInt<MOD> { fn sub_assign(&mut self, rhs: Self) { if self.val < rhs.val { self.val += MOD; } *self = *self - rhs; } } impl<const MOD: usize> ops::Div for ModInt<MOD> { type Output = Self; fn div(self, rhs: Self) -> Self { assert!(rhs.val != 0); self * rhs.pow(MOD - 2) } } impl<const MOD: usize> ops::DivAssign for ModInt<MOD> { fn div_assign(&mut self, rhs: Self) { *self = *self / rhs } } }