結果

問題 No.1683 Robot Guidance
ユーザー koba-e964koba-e964
提出日時 2021-09-17 23:46:51
言語 Rust
(1.77.0)
結果
AC  
実行時間 48 ms / 2,000 ms
コード長 5,206 bytes
コンパイル時間 1,010 ms
コンパイル使用メモリ 155,748 KB
実行使用メモリ 33,260 KB
最終ジャッジ日時 2023-09-12 10:00:09
合計ジャッジ時間 3,178 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 13 ms
10,524 KB
testcase_04 AC 3 ms
4,376 KB
testcase_05 AC 7 ms
5,108 KB
testcase_06 AC 17 ms
11,964 KB
testcase_07 AC 13 ms
10,908 KB
testcase_08 AC 42 ms
28,924 KB
testcase_09 AC 11 ms
8,672 KB
testcase_10 AC 26 ms
17,920 KB
testcase_11 AC 20 ms
12,692 KB
testcase_12 AC 34 ms
20,484 KB
testcase_13 AC 20 ms
17,644 KB
testcase_14 AC 41 ms
30,388 KB
testcase_15 AC 22 ms
18,644 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 1 ms
4,376 KB
testcase_20 AC 1 ms
4,376 KB
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 19 ms
17,652 KB
testcase_23 AC 20 ms
17,400 KB
testcase_24 AC 48 ms
33,212 KB
testcase_25 AC 22 ms
17,460 KB
testcase_26 AC 35 ms
33,136 KB
testcase_27 AC 37 ms
33,260 KB
testcase_28 AC 20 ms
17,400 KB
testcase_29 AC 21 ms
17,460 KB
testcase_30 AC 20 ms
17,472 KB
testcase_31 AC 19 ms
15,604 KB
testcase_32 AC 19 ms
15,592 KB
testcase_33 AC 20 ms
13,828 KB
testcase_34 AC 20 ms
13,848 KB
testcase_35 AC 21 ms
15,852 KB
testcase_36 AC 22 ms
15,860 KB
testcase_37 AC 15 ms
12,840 KB
testcase_38 AC 16 ms
12,824 KB
testcase_39 AC 21 ms
17,440 KB
testcase_40 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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: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>;

// Depends on MInt.rs
fn fact_init(w: usize) -> (Vec<MInt>, Vec<MInt>) {
    let mut fac = vec![MInt::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 main() {
    input!(a: usize, b: usize, x: i32, y: i32);
    if ((x + y) % 2 == 0) != (a % 2 == 0) {
        println!("0");
        return;
    }
    let (fac, invfac) = fact_init(a + b + 1);
    let b = b + 1;
    let mut bs = [b / 4; 4];
    for r in 0..b % 4 {
        bs[r as usize] += 1;
    }
    eprintln!("bs = {:?}", bs);
    let mut tot = MInt::new(0);
    for a0 in 0..a + 1 {
        let mut aa = [0; 4];
        aa[0] = a0 as i32;
        aa[1] = (a as i32 + x + y - 2 * a0 as i32) / 2;
        aa[3] = (a as i32 + x - y - 2 * a0 as i32) / 2;
        aa[2] = a0 as i32 - x;
        if aa.iter().any(|&i| i < 0) {
            continue;
        }
        // eprintln!("aa = {:?}", aa);
        let mut tmp = MInt::new(1);
        for i in 0..4 {
            let a = aa[i] as usize;
            tmp *= if bs[i] > 0 {
                fac[a + bs[i] - 1] * invfac[a] * invfac[bs[i] - 1]
            } else if aa[i] == 0 {
                MInt::new(1)
            } else {
                MInt::new(0)
            };
        }
        tot += tmp;
    }
    println!("{}", tot);
}
0