結果

問題 No.1683 Robot Guidance
ユーザー akakimidoriakakimidori
提出日時 2021-09-17 22:40:41
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 45 ms / 2,000 ms
コード長 9,587 bytes
コンパイル時間 21,326 ms
コンパイル使用メモリ 379,660 KB
実行使用メモリ 25,472 KB
最終ジャッジ日時 2024-06-29 21:25:37
合計ジャッジ時間 24,091 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
25,316 KB
testcase_01 AC 30 ms
25,264 KB
testcase_02 AC 30 ms
25,176 KB
testcase_03 AC 30 ms
25,356 KB
testcase_04 AC 31 ms
25,344 KB
testcase_05 AC 32 ms
25,344 KB
testcase_06 AC 33 ms
25,216 KB
testcase_07 AC 32 ms
25,260 KB
testcase_08 AC 43 ms
25,344 KB
testcase_09 AC 32 ms
25,252 KB
testcase_10 AC 37 ms
25,472 KB
testcase_11 AC 36 ms
25,216 KB
testcase_12 AC 44 ms
25,344 KB
testcase_13 AC 31 ms
25,344 KB
testcase_14 AC 40 ms
25,248 KB
testcase_15 AC 34 ms
25,316 KB
testcase_16 AC 31 ms
25,332 KB
testcase_17 AC 29 ms
25,296 KB
testcase_18 AC 30 ms
25,260 KB
testcase_19 AC 30 ms
25,316 KB
testcase_20 AC 30 ms
25,344 KB
testcase_21 AC 30 ms
25,244 KB
testcase_22 AC 30 ms
25,344 KB
testcase_23 AC 31 ms
25,336 KB
testcase_24 AC 45 ms
25,320 KB
testcase_25 AC 32 ms
25,344 KB
testcase_26 AC 32 ms
25,300 KB
testcase_27 AC 32 ms
25,292 KB
testcase_28 AC 33 ms
25,240 KB
testcase_29 AC 32 ms
25,412 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 32 ms
25,272 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 34 ms
25,344 KB
testcase_35 AC 34 ms
25,328 KB
testcase_36 AC 35 ms
25,252 KB
testcase_37 AC 31 ms
25,344 KB
testcase_38 AC 32 ms
25,312 KB
testcase_39 AC 32 ms
25,216 KB
testcase_40 AC 31 ms
25,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 1_000_000_007;
    }

    #[allow(dead_code)]
    pub struct StaticMod;
    static mut STATIC_MOD: u32 = 0;
    impl Modulo for StaticMod {
        fn modulo() -> u32 {
            unsafe { STATIC_MOD }
        }
    }

    #[allow(dead_code)]
    impl StaticMod {
        pub fn set_modulo(p: u32) {
            unsafe {
                STATIC_MOD = p;
            }
        }
    }

    use std::marker::*;
    use std::ops::*;

    pub trait Modulo {
        fn modulo() -> u32;
    }

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

    pub struct ModInt<T>(pub u32, PhantomData<T>);

    impl<T> Clone for ModInt<T> {
        fn clone(&self) -> Self {
            ModInt::new_unchecked(self.0)
        }
    }

    impl<T> Copy for ModInt<T> {}

    impl<T: Modulo> Add for ModInt<T> {
        type Output = ModInt<T>;
        fn add(self, rhs: Self) -> Self::Output {
            let mut d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> AddAssign for ModInt<T> {
        fn add_assign(&mut self, rhs: Self) {
            *self = *self + rhs;
        }
    }

    impl<T: Modulo> Sub for ModInt<T> {
        type Output = ModInt<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            let mut d = self.0 - rhs.0;
            if d >= T::modulo() {
                d += T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> SubAssign for ModInt<T> {
        fn sub_assign(&mut self, rhs: Self) {
            *self = *self - rhs;
        }
    }

    impl<T: Modulo> Mul for ModInt<T> {
        type Output = ModInt<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
            ModInt::new_unchecked(v as u32)
        }
    }

    impl<T: Modulo> MulAssign for ModInt<T> {
        fn mul_assign(&mut self, rhs: Self) {
            *self = *self * rhs;
        }
    }

    impl<T: Modulo> Neg for ModInt<T> {
        type Output = ModInt<T>;
        fn neg(self) -> Self::Output {
            if self.0 == 0 {
                Self::zero()
            } else {
                Self::new_unchecked(T::modulo() - self.0)
            }
        }
    }

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

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

    impl<T: Modulo> std::str::FromStr for ModInt<T> {
        type Err = std::num::ParseIntError;
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            let val = s.parse::<u32>()?;
            Ok(ModInt::new(val))
        }
    }

    impl<T: Modulo> From<usize> for ModInt<T> {
        fn from(val: usize) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as usize) as u32)
        }
    }

    impl<T: Modulo> From<u64> for ModInt<T> {
        fn from(val: u64) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as u64) as u32)
        }
    }

    impl<T: Modulo> From<i64> for ModInt<T> {
        fn from(val: i64) -> ModInt<T> {
            let m = T::modulo() as i64;
            ModInt::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModInt<T> {
        pub fn new_unchecked(d: u32) -> Self {
            ModInt(d, PhantomData)
        }
        pub fn zero() -> Self {
            ModInt::new_unchecked(0)
        }
        pub fn one() -> Self {
            ModInt::new_unchecked(1)
        }
        pub fn is_zero(&self) -> bool {
            self.0 == 0
        }
    }

    #[allow(dead_code)]
    impl<T: Modulo> ModInt<T> {
        pub fn new(d: u32) -> Self {
            ModInt::new_unchecked(d % T::modulo())
        }
        pub fn pow(&self, mut n: u64) -> Self {
            let mut t = Self::one();
            let mut s = *self;
            while n > 0 {
                if n & 1 == 1 {
                    t *= s;
                }
                s *= s;
                n >>= 1;
            }
            t
        }
        pub fn inv(&self) -> Self {
            assert!(self.0 != 0);
            self.pow(T::modulo() as u64 - 2)
        }
    }
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
mod precalc {
    use super::modint::*;
    #[allow(dead_code)]
    pub struct Precalc<T> {
        inv: Vec<ModInt<T>>,
        fact: Vec<ModInt<T>>,
        ifact: Vec<ModInt<T>>,
    }
    #[allow(dead_code)]
    impl<T: Modulo> Precalc<T> {
        pub fn new(n: usize) -> Precalc<T> {
            let mut inv = vec![ModInt::one(); n + 1];
            let mut fact = vec![ModInt::one(); n + 1];
            let mut ifact = vec![ModInt::one(); n + 1];
            for i in 2..(n + 1) {
                fact[i] = fact[i - 1] * ModInt::new_unchecked(i as u32);
            }
            ifact[n] = fact[n].inv();
            if n > 0 {
                inv[n] = ifact[n] * fact[n - 1];
            }
            for i in (1..n).rev() {
                ifact[i] = ifact[i + 1] * ModInt::new_unchecked((i + 1) as u32);
                inv[i] = ifact[i] * fact[i - 1];
            }
            Precalc {
                inv: inv,
                fact: fact,
                ifact: ifact,
            }
        }
        pub fn inv(&self, n: usize) -> ModInt<T> {
            assert!(n > 0);
            self.inv[n]
        }
        pub fn fact(&self, n: usize) -> ModInt<T> {
            self.fact[n]
        }
        pub fn ifact(&self, n: usize) -> ModInt<T> {
            self.ifact[n]
        }
        pub fn perm(&self, n: usize, k: usize) -> ModInt<T> {
            if k > n {
                return ModInt::zero();
            }
            self.fact[n] * self.ifact[n - k]
        }
        pub fn comb(&self, n: usize, k: usize) -> ModInt<T> {
            if k > n {
                return ModInt::zero();
            }
            self.fact[n] * self.ifact[k] * self.ifact[n - k]
        }
    }
}
// ---------- end Precalc ----------

use modint::*;
type M = ModInt<Mod>;

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

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

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        a: i32,
        b: i32,
        x: i32,
        y: i32,
    }
    let mut cnt = [(b + 1) / 4; 4];
    for c in cnt.iter_mut().take((b + 1) as usize % 4) {
        *c += 1;
    }
    if (y > 0 && cnt[1] == 0) || (x < 0 && cnt[2] == 0) || (y < 0 && cnt[3] < 0) {
        println!("0");
        return;
    }
    let pc = precalc::Precalc::new(2000000);
    let binom = |n: i32, k: i32| -> M {
        if n == k {
            return M::one();
        }
        if 0 <= k && k <= n {
            pc.comb(n as usize, k as usize)
        } else {
            M::zero()
        }
    };
    let mut ans = M::zero();
    for i in 0..=a {
        let j = a - i;
        if x.abs() <= i && i % 2 == x.abs() % 2 && y.abs() <= j && j % 2 == y.abs() % 2 {
            let p = (i - x.abs()) / 2;
            let q = (j - y.abs()) / 2;
            let mut way = M::one();
            if x >= 0 {
                way *= binom(cnt[0] - 1 + x + p, cnt[0] - 1);
                way *= binom(cnt[2] - 1 + p, cnt[2] - 1);
            } else {
                way *= binom(cnt[2] - 1 - x + p, cnt[2] - 1);
                way *= binom(cnt[0] - 1 + p, cnt[0] - 1);
            }
            if y >= 0 {
                way *= binom(cnt[1] - 1 + y + q, cnt[1] - 1);
                way *= binom(cnt[3] - 1 + q, cnt[3] - 1);
            } else {
                way *= binom(cnt[3] - 1 - y + q, cnt[3] - 1);
                way *= binom(cnt[1] - 1 + q, cnt[1] - 1);
            }
            ans += way;
        }
    }
    println!("{}", ans);
}

fn main() {
    run();
}
0