#706184 (Rust) No.1704 Many Bus Stops (easy)

提出ソース

結果

問題	No.1704 Many Bus Stops (easy)
ユーザー	koba-e964
提出日時	2021-10-08 23:26:01
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	142 ms / 2,000 ms
コード長	6,656 bytes
コンパイル時間	12,633 ms
コンパイル使用メモリ	407,700 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-23 07:27:22
合計ジャッジ時間	18,333 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	138 ms 6,816 KB
testcase_02	AC	45 ms 6,940 KB
testcase_03	AC	47 ms 6,940 KB
testcase_04	AC	46 ms 6,944 KB
testcase_05	AC	45 ms 6,940 KB
testcase_06	AC	46 ms 6,944 KB
testcase_07	AC	48 ms 6,940 KB
testcase_08	AC	46 ms 6,944 KB
testcase_09	AC	46 ms 6,940 KB
testcase_10	AC	46 ms 6,944 KB
testcase_11	AC	48 ms 6,944 KB
testcase_12	AC	47 ms 6,940 KB
testcase_13	AC	46 ms 6,940 KB
testcase_14	AC	46 ms 6,940 KB
testcase_15	AC	48 ms 6,944 KB
testcase_16	AC	46 ms 6,944 KB
testcase_17	AC	46 ms 6,940 KB
testcase_18	AC	47 ms 6,944 KB
testcase_19	AC	47 ms 6,940 KB
testcase_20	AC	47 ms 6,940 KB
testcase_21	AC	46 ms 6,944 KB
testcase_22	AC	142 ms 6,944 KB
testcase_23	AC	140 ms 6,944 KB
testcase_24	AC	142 ms 6,940 KB
testcase_25	AC	136 ms 6,940 KB
testcase_26	AC	139 ms 6,944 KB
testcase_27	AC	138 ms 6,940 KB
testcase_28	AC	140 ms 6,940 KB
testcase_29	AC	140 ms 6,944 KB
testcase_30	AC	142 ms 6,940 KB
testcase_31	AC	142 ms 6,940 KB
testcase_32	AC	139 ms 6,944 KB
testcase_33	AC	139 ms 6,940 KB
testcase_34	AC	139 ms 6,940 KB
testcase_35	AC	142 ms 6,944 KB
testcase_36	AC	142 ms 6,944 KB
testcase_37	AC	141 ms 6,940 KB
testcase_38	AC	140 ms 6,940 KB
testcase_39	AC	138 ms 6,944 KB
testcase_40	AC	140 ms 6,940 KB
testcase_41	AC	141 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342
mod 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 >= 0
        pub 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, 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> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            let (mut a, mut b, _) = red(self.x, M::m());
            if b < 0 {
                a = -a;
                b = -b;
            }
            write!(f, "{}/{}", a, b)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
    // Finds the simplest fraction x/y congruent to r mod p.
    // The return value (x, y, z) satisfies x = y * r + z * p.
    fn red(r: i64, p: i64) -> (i64, i64, i64) {
        if r.abs() <= 10000 {
            return (r, 1, 0);
        }
        let mut nxt_r = p % r;
        let mut q = p / r;
        if 2 * nxt_r >= r {
            nxt_r -= r;
            q += 1;
        }
        if 2 * nxt_r <= -r {
            nxt_r += r;
            q -= 1;
        }
        let (x, z, y) = red(nxt_r, r);
        (x, y - q * z, z)
    }
} // mod mod_int

macro_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 = 1_000_000_007;
define_mod!(P, MOD);
type MInt = mod_int::ModInt<P>;

// Depends on MInt.rs
// Verified by: https://atcoder.jp/contests/abc199/submissions/22259436
fn squmul(a: &[Vec<MInt>], b: &[Vec<MInt>]) -> Vec<Vec<MInt>> {
    let n = a.len();
    let mut ret = vec![vec![MInt::new(0); n]; n];
    for i in 0..n {
        for j in 0..n {
            for k in 0..n {
                ret[i][k] += a[i][j] * b[j][k];
            }
        }
    }
    ret
}

fn squpow(a: &[Vec<MInt>], mut e: i64) -> Vec<Vec<MInt>> {
    let n = a.len();
    let mut sum = vec![vec![MInt::new(0); n]; n];
    for i in 0..n { sum[i][i] = 1.into(); }
    let mut cur = a.to_vec();
    while e > 0 {
        if e % 2 == 1 {
            sum = squmul(&sum, &cur);
        }
        cur = squmul(&cur, &cur);
        e /= 2;
    }
    sum
}

trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        t: usize,
        n: [i64; t],
    }
    let mut tr = vec![vec![MInt::new(0); 6]; 6];
    let inv3 = MInt::new(3).inv();
    for i in 0..3 {
        tr[3 + i][i] = 1.into();
        tr[i][i] = inv3;
        for j in 1..3 {
            tr[i][(i + j) % 3 + 3] = inv3;
        }
    }
    for n in n {
        let a = squpow(&tr, n);
        puts!("{}\n", a[0][0]);
    }
}

yukicoder

結果

テストケース

ソースコード