#542337 (Rust) No.1202 お菓子の食べ方

• 問題: No.1202 お菓子の食べ方
• ユーザー: koba-e964
• 提出日時: 2020-08-28 22:31:06
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 131 ms / 2,000 ms
• コード長: 7,885 bytes
• コンパイル時間: 14,511 ms
• コンパイル使用メモリ: 401,380 KB
• 実行使用メモリ: 26,204 KB
• 最終ジャッジ日時: 2024-11-14 01:22:03
• 合計ジャッジ時間: 20,109 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	129 ms; 26,152 KB
testcase_01	AC	130 ms; 26,132 KB
testcase_02	AC	130 ms; 26,080 KB
testcase_03	AC	131 ms; 26,204 KB
testcase_04	AC	131 ms; 26,188 KB
testcase_05	AC	129 ms; 26,088 KB
testcase_06	AC	129 ms; 26,096 KB
testcase_07	AC	131 ms; 26,100 KB
testcase_08	AC	129 ms; 26,152 KB
testcase_09	AC	131 ms; 26,156 KB
testcase_10	AC	23 ms; 18,528 KB
testcase_11	AC	35 ms; 19,320 KB
testcase_12	AC	78 ms; 22,372 KB
testcase_13	AC	24 ms; 18,628 KB
testcase_14	AC	76 ms; 22,200 KB
testcase_15	AC	22 ms; 18,400 KB
testcase_16	AC	57 ms; 20,916 KB
testcase_17	AC	37 ms; 19,464 KB
testcase_18	AC	35 ms; 19,440 KB
testcase_19	AC	23 ms; 18,708 KB
testcase_20	AC	61 ms; 21,144 KB
testcase_21	AC	63 ms; 21,232 KB
testcase_22	AC	25 ms; 18,892 KB
testcase_23	AC	50 ms; 20,600 KB
testcase_24	AC	52 ms; 20,512 KB
testcase_25	AC	24 ms; 18,632 KB
testcase_26	AC	68 ms; 21,560 KB
testcase_27	AC	59 ms; 20,960 KB
testcase_28	AC	31 ms; 19,016 KB
testcase_29	AC	38 ms; 19,660 KB
testcase_30	AC	20 ms; 18,296 KB
testcase_31	AC	20 ms; 18,388 KB
testcase_32	AC	20 ms; 18,328 KB
testcase_33	AC	19 ms; 18,208 KB
testcase_34	AC	20 ms; 18,292 KB
testcase_35	AC	19 ms; 18,208 KB
testcase_36	AC	20 ms; 18,324 KB
testcase_37	AC	19 ms; 18,216 KB
testcase_38	AC	19 ms; 18,212 KB
testcase_39	AC	19 ms; 18,284 KB
testcase_40	AC	131 ms; 26,104 KB
testcase_41	AC	131 ms; 26,196 KB
testcase_42	AC	131 ms; 26,148 KB
testcase_43	AC	130 ms; 26,204 KB
testcase_44	AC	130 ms; 26,096 KB

ソースコード

#[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, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/// Verified by https://atcoder.jp/contests/arc093/submissions/3968098
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 ModInt = mod_int::ModInt<P>;

// Depends on ModInt.rs
fn fact_init(w: usize) -> (Vec<ModInt>, Vec<ModInt>) {
    let mut fac = vec![ModInt::new(1); w];
    let mut invfac = vec![0.into(); w];
    for i in 1 .. w {
        fac[i] = fac[i - 1] * i as i64;
    }
    invfac[w - 1] = fac[w - 1].inv();
    for i in (0 .. w - 1).rev() {
        invfac[i] = invfac[i + 1] * (i as i64 + 1);
    }
    (fac, invfac)
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, m: usize,
        s: [[usize; m]; n],
    }
    const W: usize = 1 << 20;
    let (fac, invfac) = fact_init(n + m + 1 + W);
    let mut tot = ModInt::new(0);
    for i in 0..n {
        for j in 0..m {
            let ma = if i < n && j < m { s[i][j] } else { 0 };
            let tmp = fac[i + j + ma - 1] * invfac[i] * invfac[j] * invfac[ma - 1];
            tot += tmp;
        }
    }
    for i in 0..n {
        for j in 0..m {
            let ma = s[i][j];
            let nxt = if i < n - 1 { s[i + 1][j] } else { 0 };
            let mut acc = fac[i + j + ma] * invfac[i + j + 1] * invfac[ma - 1];
            if nxt > 0 {
                acc -= fac[i + j + nxt] * invfac[i + j + 1] * invfac[nxt - 1];
            }
            let tmp = invfac[i] * invfac[j] * fac[i + j] * acc;
            tot += tmp;
        }
    }
    for i in 0..n {
        for j in 0..m {
            let ma = s[i][j];
            let nxt = if j < m - 1 { s[i][j + 1] } else { 0 };
            let mut acc = fac[i + j + ma] * invfac[i + j + 1] * invfac[ma - 1];
            if nxt > 0 {
                acc -= fac[i + j + nxt] * invfac[i + j + 1] * invfac[nxt - 1];
            }
            let tmp = invfac[i] * invfac[j] * fac[i + j] * acc;
            tot += tmp;
        }
    }
    puts!("{}\n", tot);
}

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();
}