結果
問題 | No.1887 K Consecutive Ks (Easy) |
ユーザー |
|
提出日時 | 2023-06-16 01:09:48 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 260 ms / 2,000 ms |
コード長 | 4,446 bytes |
コンパイル時間 | 16,980 ms |
コンパイル使用メモリ | 403,208 KB |
実行使用メモリ | 142,976 KB |
最終ジャッジ日時 | 2024-06-23 21:42:14 |
合計ジャッジ時間 | 16,846 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 |
ソースコード
use std::cmp::*;use std::io::Read;fn get_word() -> String {let stdin = std::io::stdin();let mut stdin=stdin.lock();let mut u8b: [u8; 1] = [0];loop {let mut buf: Vec<u8> = Vec::with_capacity(16);loop {let res = stdin.read(&mut u8b);if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {break;} else {buf.push(u8b[0]);}}if buf.len() >= 1 {let ret = String::from_utf8(buf).unwrap();return ret;}}}fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342mod mod_int {use std::ops::*;pub trait Mod: Copy { fn m() -> i64; }#[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }impl<M: Mod> ModInt<M> {// x >= 0pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }fn new_internal(x: i64) -> Self {ModInt { x: x, phantom: ::std::marker::PhantomData }}pub fn pow(self, mut e: i64) -> Self {debug_assert!(e >= 0);let mut sum = ModInt::new_internal(1);let mut cur = self;while e > 0 {if e % 2 != 0 { sum *= cur; }cur *= cur;e /= 2;}sum}#[allow(dead_code)]pub fn inv(self) -> Self { self.pow(M::m() - 2) }}impl<M: Mod> Default for ModInt<M> {fn default() -> Self { Self::new_internal(0) }}impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {type Output = Self;fn add(self, other: T) -> Self {let other = other.into();let mut sum = self.x + other.x;if sum >= M::m() { sum -= M::m(); }ModInt::new_internal(sum)}}impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {type Output = Self;fn sub(self, other: T) -> Self {let other = other.into();let mut sum = self.x - other.x;if sum < 0 { sum += M::m(); }ModInt::new_internal(sum)}}impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {type Output = Self;fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }}impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {fn add_assign(&mut self, other: T) { *self = *self + other; }}impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {fn sub_assign(&mut self, other: T) { *self = *self - other; }}impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {fn mul_assign(&mut self, other: T) { *self = *self * other; }}impl<M: Mod> Neg for ModInt<M> {type Output = Self;fn neg(self) -> Self { ModInt::new(0) - self }}impl<M> ::std::fmt::Display for ModInt<M> {fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {self.x.fmt(f)}}impl<M: Mod> From<i64> for ModInt<M> {fn from(x: i64) -> Self { Self::new(x) }}} // mod mod_intmacro_rules! define_mod {($struct_name: ident, $modulo: expr) => {#[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]struct $struct_name {}impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }}}const MOD: i64 = 998_244_353;define_mod!(P, MOD);type MInt = mod_int::ModInt<P>;// https://yukicoder.me/problems/no/1887 (3.5)// dp[i][j] = 最後が j で長さが i である数列の総数 とする。// これは累積和を使って高速化できる。fn main() {let n: usize = get();let m: usize = get();let mut dp = vec![vec![MInt::new(0); m]; n + 1];let mut acc = vec![MInt::new(0); n + 2];let mut acc_s = vec![vec![MInt::new(0); m]; n + 2];acc[1] += 1;for i in 1..n + 1 {acc[i + 1] = acc[i];for j in 1..m {dp[i][j] = acc[i] - acc[max(i, j) - j] - acc_s[i][j] + acc_s[max(i, j) - j][j];acc[i + 1] += dp[i][j];acc_s[i + 1][j] = acc_s[i][j] + dp[i][j];}}println!("{}", MInt::new(m as i64).pow(n as i64) - (acc[n + 1] - acc[n]));}