結果
問題 |
No.1238 選抜クラス
|
ユーザー |
|
提出日時 | 2024-10-01 21:49:25 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 24 ms / 2,000 ms |
コード長 | 3,876 bytes |
コンパイル時間 | 12,547 ms |
コンパイル使用メモリ | 404,020 KB |
実行使用メモリ | 18,176 KB |
最終ジャッジ日時 | 2024-10-01 21:49:42 |
合計ジャッジ時間 | 14,272 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
use proconio::input; fn main() { input! { n:usize, k:i64, a:[i64;n], } const K: usize = 100; let b = a.into_iter().map(|ai| ai - k).collect::<Vec<_>>(); let mut dp = vec![vec![ModInt::<MOD>::new(0); 2 * K * n + 1]; n + 1]; dp[0][K * n] = ModInt::new(1); for i in 0..n { for j in 0..=2 * K * n { dp[i + 1][j] = dp[i + 1][j] + dp[i][j]; if 0 <= j as i64 + b[i] && j as i64 + b[i] <= (2 * K * n) as i64 { dp[i + 1][(j as i64 + b[i]) as usize] = dp[i + 1][(j as i64 + b[i]) as usize] + dp[i][j]; } } } let mut ans = ModInt::new(0); for i in K * n..=2 * K * n { ans += dp[n][i]; } ans -= ModInt::new(1); println!("{}", ans); } const MOD: usize = 1000000007; 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 } } }