結果

問題 No.1513 simple 門松列 problem
ユーザー fukafukatanifukafukatani
提出日時 2021-05-22 11:21:51
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 392 ms / 3,000 ms
コード長 8,511 bytes
コンパイル時間 13,524 ms
コンパイル使用メモリ 392,116 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-10-10 10:52:23
合計ジャッジ時間 14,762 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,820 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 392 ms
6,820 KB
testcase_03 AC 1 ms
6,820 KB
testcase_04 AC 1 ms
6,816 KB
testcase_05 AC 1 ms
6,816 KB
testcase_06 AC 1 ms
6,820 KB
testcase_07 AC 1 ms
6,816 KB
testcase_08 AC 1 ms
6,816 KB
testcase_09 AC 1 ms
6,816 KB
testcase_10 AC 1 ms
6,820 KB
testcase_11 AC 0 ms
6,820 KB
testcase_12 AC 1 ms
6,824 KB
testcase_13 AC 1 ms
6,816 KB
testcase_14 AC 377 ms
6,816 KB
testcase_15 AC 376 ms
6,820 KB
testcase_16 AC 386 ms
6,816 KB
testcase_17 AC 230 ms
6,820 KB
testcase_18 AC 78 ms
6,816 KB
testcase_19 AC 5 ms
6,816 KB
testcase_20 AC 45 ms
6,816 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: associated items `set_modulus`, `pow`, and `inv` are never used
   --> src/main.rs:128:8
    |
127 | impl Modulo {
    | ----------- associated items in this implementation
128 |     fn set_modulus(m: i64) {
    |        ^^^^^^^^^^^
...
146 |     fn pow(self, p: i64) -> Modulo {
    |        ^^^
...
158 |     fn inv(self) -> Modulo {
    |        ^^^
    |
    = note: `#[warn(dead_code)]` on by default

ソースコード

diff # 

#![allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;
use std::ops::Bound::*;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn main() {
    let v = read_vec::<usize>();
    let (n, k) = (v[0], v[1]);
    let mut dp = vec![vec![Modulo(0); k]; k];
    let mut dp2 = vec![vec![Modulo(0); k]; k];
    for first in 0..k {
        for second in first + 1..k {
            dp[first][second] += 1;
            dp2[first][second] += (first + second) as i64;
        }
        for second in 0..first {
            dp[first][second] += 1;
            dp2[first][second] += (first + second) as i64;
        }
    }

    for _ in 2..n {
        let mut next = vec![vec![Modulo(0); k]; k];
        let mut next2 = vec![vec![Modulo(0); k]; k];

        let mut dp_from_upper = dp.clone();
        for second in 0..k {
            dp_from_upper[k - 1][second] = dp[k - 1][second];
            for first in (0..k - 1).rev() {
                let val = dp_from_upper[first + 1][second];
                dp_from_upper[first][second] += val;
            }
        }
        let mut dp2_from_upper = dp2.clone();
        for second in 0..k {
            dp2_from_upper[k - 1][second] = dp2[k - 1][second];
            for first in (0..k - 1).rev() {
                let val = dp2_from_upper[first + 1][second];
                dp2_from_upper[first][second] += val;
            }
        }

        let mut dp_from_lower = dp.clone();
        for second in 0..k {
            dp_from_lower[0][second] = dp[0][second];
            for first in 1..k {
                let val = dp_from_lower[first - 1][second];
                dp_from_lower[first][second] += val;
            }
        }
        let mut dp2_from_lower = dp2.clone();
        for second in 0..k {
            dp2_from_lower[0][second] = dp2[0][second];
            for first in 1..k {
                let val = dp2_from_lower[first - 1][second];
                dp2_from_lower[first][second] += val;
            }
        }

        for second in 1..k {
            for third in 0..second {
                next[second][third] = dp_from_lower[second - 1][second] - dp[third][second];
            }
        }
        for second in 0..k - 1 {
            for third in second + 1..k {
                next[second][third] = dp_from_upper[second + 1][second] - dp[third][second];
            }
        }

        for second in 1..k {
            for third in 0..second {
                next2[second][third] += dp2_from_lower[second - 1][second] - dp2[third][second];
                next2[second][third] += next[second][third] * third as i64;
            }
        }
        for second in 0..k - 1 {
            for third in second + 1..k {
                next2[second][third] += dp2_from_upper[second + 1][second] - dp2[third][second];
                next2[second][third] += next[second][third] * third as i64;
            }
        }

        dp = next;
        dp2 = next2;
    }

    let mut ans1 = Modulo(0);
    let mut ans2 = Modulo(0);
    for i in 0..k {
        for j in 0..k {
            ans1 += dp[i][j];
            ans2 += dp2[i][j];
        }
    }
    println!("{} {}", ans1, ans2);
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[derive(Clone, Copy, Debug, Default, Eq, Hash, Ord, PartialEq, PartialOrd)]
struct Modulo(i64);
static mut MODULUS: i64 = 998244353;
impl Modulo {
    fn set_modulus(m: i64) {
        unsafe {
            MODULUS = m;
        }
    }
    fn get_modulus() -> i64 {
        unsafe { MODULUS }
    }
    fn new(x: i64) -> Modulo {
        let m = Modulo::get_modulus();
        if x < 0 {
            Modulo(x % m + m)
        } else if x < m {
            Modulo(x)
        } else {
            Modulo(x % m)
        }
    }
    fn pow(self, p: i64) -> Modulo {
        if p == 0 {
            Modulo(1)
        } else {
            let mut t = self.pow(p / 2);
            t *= t;
            if p & 1 == 1 {
                t *= self;
            }
            t
        }
    }
    fn inv(self) -> Modulo {
        self.pow(Modulo::get_modulus() - 2)
    }
}
impl std::fmt::Display for Modulo {
    fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
        self.0.fmt(f)
    }
}
impl std::ops::AddAssign for Modulo {
    fn add_assign(&mut self, other: Modulo) {
        let m = Modulo::get_modulus();
        self.0 += other.0;
        if self.0 >= m {
            self.0 -= m;
        }
    }
}
impl std::ops::MulAssign for Modulo {
    fn mul_assign(&mut self, other: Modulo) {
        let m = Modulo::get_modulus();
        self.0 *= other.0;
        self.0 %= m;
    }
}
impl std::ops::SubAssign for Modulo {
    fn sub_assign(&mut self, other: Modulo) {
        let m = Modulo::get_modulus();
        self.0 += m - other.0;
        if self.0 >= m {
            self.0 -= m;
        }
    }
}
macro_rules! impl_modulo_ops {
    ($imp:ident, $method:ident, $assign_imp:ident, $assign_method:ident) => {
        impl<'a> std::ops::$assign_imp<&'a Modulo> for Modulo {
            fn $assign_method(&mut self, other: &'a Modulo) {
                std::ops::$assign_imp::$assign_method(self, *other);
            }
        }
        impl std::ops::$imp for Modulo {
            type Output = Modulo;
            fn $method(self, other: Modulo) -> Modulo {
                let mut x = self;
                std::ops::$assign_imp::$assign_method(&mut x, other);
                x
            }
        }
        impl<'a> std::ops::$imp<Modulo> for &'a Modulo {
            type Output = Modulo;
            fn $method(self, other: Modulo) -> Modulo {
                std::ops::$imp::$method(*self, other)
            }
        }
        impl<'a> std::ops::$imp<&'a Modulo> for Modulo {
            type Output = Modulo;
            fn $method(self, other: &'a Modulo) -> Modulo {
                std::ops::$imp::$method(self, *other)
            }
        }
        impl<'a, 'b> std::ops::$imp<&'b Modulo> for &'a Modulo {
            type Output = Modulo;
            fn $method(self, other: &'b Modulo) -> Modulo {
                std::ops::$imp::$method(*self, *other)
            }
        }
        impl std::ops::$assign_imp<i64> for Modulo {
            fn $assign_method(&mut self, other: i64) {
                std::ops::$assign_imp::$assign_method(self, Modulo::new(other));
            }
        }
        impl<'a> std::ops::$assign_imp<&'a i64> for Modulo {
            fn $assign_method(&mut self, other: &'a i64) {
                std::ops::$assign_imp::$assign_method(self, *other);
            }
        }
        impl std::ops::$imp<i64> for Modulo {
            type Output = Modulo;
            fn $method(self, other: i64) -> Modulo {
                let mut x = self;
                std::ops::$assign_imp::$assign_method(&mut x, other);
                x
            }
        }
        impl<'a> std::ops::$imp<&'a i64> for Modulo {
            type Output = Modulo;
            fn $method(self, other: &'a i64) -> Modulo {
                std::ops::$imp::$method(self, *other)
            }
        }
        impl<'a> std::ops::$imp<i64> for &'a Modulo {
            type Output = Modulo;
            fn $method(self, other: i64) -> Modulo {
                std::ops::$imp::$method(*self, other)
            }
        }
        impl<'a, 'b> std::ops::$imp<&'b i64> for &'a Modulo {
            type Output = Modulo;
            fn $method(self, other: &'b i64) -> Modulo {
                std::ops::$imp::$method(*self, *other)
            }
        }
    };
}
impl_modulo_ops!(Add, add, AddAssign, add_assign);
impl_modulo_ops!(Mul, mul, MulAssign, mul_assign);
impl_modulo_ops!(Sub, sub, SubAssign, sub_assign);

use std::iter::Sum;
impl Sum for Modulo {
    fn sum<I>(iter: I) -> Self
    where
        I: Iterator<Item = Modulo>,
    {
        iter.fold(Modulo(0), |a, b| a + b)
    }
}

impl<'a> Sum<&'a Modulo> for Modulo {
    fn sum<I>(iter: I) -> Self
    where
        I: Iterator<Item = &'a Self>,
    {
        iter.fold(Modulo(0), |a, b| a + b)
    }
}
0