#700959 (Rust) No.1141 田グリッド

提出ソース

結果

問題	No.1141 田グリッド
ユーザー	koba-e964
提出日時	2021-09-18 11:46:18
言語	Rust (1.77.0)
結果	AC
実行時間	67 ms / 2,000 ms
コード長	5,140 bytes
コンパイル時間	1,386 ms
コンパイル使用メモリ	160,380 KB
実行使用メモリ	5,816 KB
最終ジャッジ日時	2023-09-12 21:26:32
合計ジャッジ時間	4,761 ms
ジャッジサーバーID （参考情報）	judge11 / judge15

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,376 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	1 ms 4,380 KB
testcase_05	AC	1 ms 4,380 KB
testcase_06	AC	1 ms 4,376 KB
testcase_07	AC	1 ms 4,376 KB
testcase_08	AC	2 ms 4,380 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	2 ms 4,376 KB
testcase_11	AC	3 ms 4,384 KB
testcase_12	AC	2 ms 4,376 KB
testcase_13	AC	58 ms 4,376 KB
testcase_14	AC	67 ms 5,816 KB
testcase_15	AC	56 ms 4,380 KB
testcase_16	AC	57 ms 4,380 KB
testcase_17	AC	57 ms 4,384 KB
testcase_18	AC	54 ms 4,376 KB
testcase_19	AC	55 ms 4,376 KB
testcase_20	AC	54 ms 4,376 KB
testcase_21	AC	56 ms 4,380 KB
testcase_22	AC	57 ms 4,380 KB
testcase_23	AC	57 ms 4,380 KB
testcase_24	AC	55 ms 4,380 KB
testcase_25	AC	54 ms 4,380 KB
testcase_26	AC	54 ms 4,376 KB
testcase_27	AC	54 ms 4,376 KB
testcase_28	AC	54 ms 4,380 KB
testcase_29	AC	55 ms 4,376 KB
testcase_30	AC	54 ms 4,380 KB
testcase_31	AC	55 ms 4,380 KB
testcase_32	AC	54 ms 4,376 KB
testcase_33	AC	55 ms 4,380 KB

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

ソースコード

raw source code

use std::cmp::*;
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),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($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> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
} // 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>;

fn main() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        h: usize, w: usize,
        a: [[i64; w]; h],
        q: usize,
        rc: [(usize1, usize1); q],
    }
    let mut row = vec![MInt::new(1); h];
    let mut col = vec![MInt::new(1); w];
    let mut rz = vec![0; h];
    let mut cz = vec![0; w];
    for i in 0..h {
        for j in 0..w {
            row[i] *= max(a[i][j], 1);
            col[j] *= max(a[i][j], 1);
            let v = if a[i][j] == 0 { 1 } else { 0 };
            rz[i] += v;
            cz[j] += v;
        }
    }
    let mut prod = MInt::new(1);
    let mut zero = 0;
    for i in 0..h {
        prod *= row[i];
        zero += rz[i];
    }
    for (r, c) in rc {
        let tmp = prod * row[r].inv() * col[c].inv() * max(a[r][c], 1);
        let tz = zero - rz[r] - cz[c] + if a[r][c] == 0 { 1 } else { 0 };
        if tz == 0 {
            puts!("{}\n", tmp);
        } else {
            puts!("0\n");
        }
    }
}

yukicoder

結果

テストケース

ソースコード