結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
ユーザー Strorkis
提出日時 2021-11-20 11:59:18
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 192 ms / 2,000 ms
コード長 6,758 bytes
コンパイル時間 15,440 ms
コンパイル使用メモリ 379,308 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2025-01-03 09:01:29
合計ジャッジ時間 18,625 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

pub mod io {
    pub fn scan<R: std::io::BufRead>(r: &mut R) -> Vec<u8> {
        let mut res = Vec::new();
        loop {
            let buf = match r.fill_buf() {
                Ok(buf) => buf,
                Err(e) if e.kind() == std::io::ErrorKind::Interrupted => continue,
                Err(e) => panic!("{}", e), 
            };
            let (done, used, buf) = match buf.iter().position(u8::is_ascii_whitespace) {
                Some(i) => (i > 0 || res.len() > 0, i + 1, &buf[..i]),
                None => (buf.is_empty(), buf.len(), buf),
            };
            res.extend_from_slice(buf);
            r.consume(used);
            if done { return res; }
        }
    }

    #[macro_export]
    macro_rules! scan {
        ($r:expr, [$t:tt; $n:expr]) => ((0..$n).map(|_| scan!($r, $t)).collect::<Vec<_>>());
        ($r:expr, [$t:tt]) => (scan!($r, [$t; scan!($r, usize)]));
        ($r:expr, ($($t:tt),*)) => (($(scan!($r, $t)),*));
        ($r:expr, Usize1) => (scan!($r, usize) - 1);
        ($r:expr, String) => (String::from_utf8(scan!($r, Bytes)).unwrap());
        ($r:expr, Bytes) => (io::scan($r));
        ($r:expr, $t:ty) => (scan!($r, String).parse::<$t>().unwrap());
    }

    #[macro_export]
    macro_rules! input {
        ($r:expr, $($($v:ident)* : $t:tt),* $(,)?) => {
            $(let $($v)* = scan!($r, $t);)*
        };
    }
}

pub mod mod_int {
    use std::fmt;
    use std::ops::*;

    #[derive(Clone, Copy, Debug, Default)]
    pub struct ModInt(u64);

    impl ModInt {
        const MOD: u64 = 998_244_353;

        pub fn new(mut x: u64) -> Self {
            if x >= Self::MOD {
                x %= Self::MOD;
            }
            Self(x)
        }

        pub fn zero() -> Self {
            Self(0)
        }

        pub fn one() -> Self {
            Self(1)
        }
    }

    impl From<usize> for ModInt {
        fn from(x: usize) -> Self {
            Self::new(x as u64)
        }
    }

    impl From<i64> for ModInt {
        fn from(mut x: i64) -> Self {
            let m = Self::MOD as i64;
            if x.abs() >= m {
                x %= m;
            }
            if x < 0 {
                x += m
            }
            Self::new(x as u64)
        }
    }

    impl Add for ModInt {
        type Output = Self;

        fn add(self, other: Self) -> Self {
            let mut x = self.0 + other.0;
            if x >= Self::MOD {
                x -= Self::MOD;
            }
            Self(x)
        }
    }

    impl AddAssign for ModInt {
        fn add_assign(&mut self, other: Self) {
            *self = *self + other;
        }
    }

    impl Sub for ModInt {
        type Output = Self;

        fn sub(mut self, other: Self) -> Self {
            if self.0 < other.0 {
                self.0 += Self::MOD;
            }
            Self(self.0 - other.0)
        }
    }

    impl SubAssign for ModInt {
        fn sub_assign(&mut self, other: Self) {
            *self = *self - other;
        }
    }

    impl Mul for ModInt {
        type Output = Self;

        fn mul(self, other: Self) -> Self {
            Self::new(self.0 * other.0)
        }
    }

    impl MulAssign for ModInt {
        fn mul_assign(&mut self, other: Self) {
            *self = *self * other;
        }
    }

    impl fmt::Display for ModInt {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl ModInt {
        pub fn pow(mut self, mut n: u64) -> Self {
            let mut res = Self::one();
            while n > 0 {
                if n & 1 == 1 {
                    res *= self;
                }
                self *= self;
                n >>= 1;
            }
            res
        }
        
        pub fn inv(self) -> Self {
            self.pow(Self::MOD - 2)
        }
    }
}

pub mod matrix {
    use std::ops::{Add, Mul};

    pub trait MatrixHelper: Add<Output = Self> + Mul<Output = Self> + Copy {
        fn zero() -> Self;
        fn one() -> Self;
    }
    
    #[derive(Clone, Debug)]
    pub struct Matrix<M> {
        n: usize, m: usize, a: Vec<Vec<M>>,
    }

    impl<M: MatrixHelper> Matrix<M> {
        pub fn new(n: usize, m: usize, a: Vec<Vec<M>>) -> Self {
            Matrix {
                n, m, a
            }
        }

        pub fn zero(n: usize, m: usize) -> Self {
            Matrix::new(n, m, vec![vec![M::zero(); m]; n])
        }

        pub fn identity(n: usize) -> Self {
            let mut res = Matrix::zero(n, n);
            for i in 0..n {
                res.a[i][i] = M::one();
            }
            res
        }

        pub fn get(&self, i: usize, j: usize) -> &M {
            &self.a[i][j]
        }

        pub fn set(&mut self, i: usize, j: usize, m: M) {
            self.a[i][j] = m;
        }

        pub fn mul(&self, other: &Self) -> Self {
            assert!(self.m == other.n);
            let mut res = Matrix::zero(self.n, other.m);
            for (res, b) in res.a.iter_mut().zip(self.a.iter()) {
                for (&b, c) in b.iter().zip(other.a.iter()) {
                    for (res, &c) in res.iter_mut().zip(c.iter()) {
                        *res = *res + b * c;
                    }
                }
            }
            res
        }

        pub fn pow(self, mut n: u64) -> Self {
            assert!(self.n == self.m);
            let mut res = Matrix::identity(self.n);
            let mut x = self.clone();
            while n > 0 {
                if n & 1 == 1 {
                    res = res.mul(&x);
                }
                x = x.mul(&x);
                n >>= 1;
            }
            res
        }
    }
}

use mod_int::ModInt;
use matrix::{Matrix, MatrixHelper};

impl MatrixHelper for ModInt {
    fn zero() -> Self {
        Self::zero()
    }

    fn one() -> Self {
        Self::one()
    }
}

fn run<R: std::io::BufRead, W: std::io::Write>(reader: &mut R, writer: &mut W) {
    input! {
        reader,
        n: usize, m: usize, t: u64,
        edges: [(usize, usize); m],
    }

    let a = {
        let mut a = vec![vec![ModInt::zero()]; n];
        a[0] = vec![ModInt::one()];
        Matrix::new(n, 1, a)
    };

    let x = {
        let mut x = vec![vec![ModInt::zero(); n]; n];
        for (s, t) in edges {
            x[s][t] = ModInt::one();
            x[t][s] = ModInt::one();
        }
        Matrix::new(n, n, x)
    };

    let ans = x.pow(t).mul(&a);
    writeln!(writer, "{}", ans.get(0, 0)).ok();
}

fn main() {
    let (stdin, stdout) = (std::io::stdin(), std::io::stdout());
    let ref mut reader = std::io::BufReader::new(stdin.lock());
    let ref mut writer = std::io::BufWriter::new(stdout.lock());
    run(reader, writer);
}
0