結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー koba-e964koba-e964
提出日時 2021-10-09 11:48:15
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 1,027 ms / 2,000 ms
コード長 5,572 bytes
コンパイル時間 14,150 ms
コンパイル使用メモリ 383,268 KB
実行使用メモリ 18,364 KB
最終ジャッジ日時 2024-07-26 19:15:17
合計ジャッジ時間 29,135 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,812 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 13 ms
12,056 KB
testcase_05 AC 1 ms
6,944 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 97 ms
14,596 KB
testcase_10 AC 67 ms
6,940 KB
testcase_11 AC 131 ms
14,824 KB
testcase_12 AC 58 ms
6,940 KB
testcase_13 AC 393 ms
18,116 KB
testcase_14 AC 135 ms
6,940 KB
testcase_15 AC 44 ms
6,940 KB
testcase_16 AC 65 ms
7,484 KB
testcase_17 AC 120 ms
10,932 KB
testcase_18 AC 729 ms
14,216 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 1 ms
6,940 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,944 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 1 ms
6,944 KB
testcase_27 AC 1 ms
6,940 KB
testcase_28 AC 1 ms
6,940 KB
testcase_29 AC 1 ms
6,940 KB
testcase_30 AC 1 ms
6,944 KB
testcase_31 AC 1 ms
6,944 KB
testcase_32 AC 1 ms
6,940 KB
testcase_33 AC 1 ms
6,940 KB
testcase_34 AC 1 ms
6,940 KB
testcase_35 AC 1 ms
6,940 KB
testcase_36 AC 1 ms
6,944 KB
testcase_37 AC 1 ms
6,940 KB
testcase_38 AC 1 ms
6,940 KB
testcase_39 AC 1 ms
6,940 KB
testcase_40 AC 1 ms
6,940 KB
testcase_41 AC 1 ms
6,940 KB
testcase_42 AC 1 ms
6,940 KB
testcase_43 AC 1 ms
6,944 KB
testcase_44 AC 1 ms
6,940 KB
testcase_45 AC 1 ms
6,940 KB
testcase_46 AC 1 ms
6,944 KB
testcase_47 AC 1 ms
6,944 KB
testcase_48 AC 1 ms
6,940 KB
testcase_49 AC 756 ms
6,940 KB
testcase_50 AC 41 ms
6,944 KB
testcase_51 AC 39 ms
6,940 KB
testcase_52 AC 125 ms
6,940 KB
testcase_53 AC 66 ms
6,944 KB
testcase_54 AC 151 ms
6,940 KB
testcase_55 AC 6 ms
6,940 KB
testcase_56 AC 56 ms
6,940 KB
testcase_57 AC 325 ms
6,944 KB
testcase_58 AC 634 ms
6,940 KB
testcase_59 AC 478 ms
6,944 KB
testcase_60 AC 210 ms
6,940 KB
testcase_61 AC 1,027 ms
6,944 KB
testcase_62 AC 218 ms
6,940 KB
testcase_63 AC 639 ms
6,944 KB
testcase_64 AC 141 ms
6,944 KB
testcase_65 AC 100 ms
6,940 KB
testcase_66 AC 189 ms
6,940 KB
testcase_67 AC 170 ms
6,944 KB
testcase_68 AC 154 ms
6,944 KB
testcase_69 AC 14 ms
12,536 KB
testcase_70 AC 10 ms
9,560 KB
testcase_71 AC 8 ms
6,944 KB
testcase_72 AC 16 ms
14,788 KB
testcase_73 AC 9 ms
6,956 KB
testcase_74 AC 8 ms
6,940 KB
testcase_75 AC 8 ms
6,940 KB
testcase_76 AC 10 ms
9,252 KB
testcase_77 AC 10 ms
9,312 KB
testcase_78 AC 5 ms
6,944 KB
testcase_79 AC 7 ms
6,940 KB
testcase_80 AC 4 ms
6,940 KB
testcase_81 AC 2 ms
6,940 KB
testcase_82 AC 16 ms
13,976 KB
testcase_83 AC 8 ms
7,764 KB
testcase_84 AC 6 ms
6,944 KB
testcase_85 AC 16 ms
15,644 KB
testcase_86 AC 16 ms
14,196 KB
testcase_87 AC 3 ms
6,944 KB
testcase_88 AC 1 ms
6,944 KB
testcase_89 AC 253 ms
9,692 KB
testcase_90 AC 432 ms
18,364 KB
testcase_91 AC 771 ms
15,408 KB
testcase_92 AC 108 ms
6,944 KB
testcase_93 AC 464 ms
13,592 KB
testcase_94 AC 19 ms
11,816 KB
testcase_95 AC 486 ms
10,608 KB
testcase_96 AC 386 ms
17,848 KB
testcase_97 AC 357 ms
15,508 KB
testcase_98 AC 168 ms
15,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;

#[allow(dead_code)]
fn getline() -> String {
    let mut ret = String::new();
    std::io::stdin().read_line(&mut ret).ok().unwrap();
    ret
}

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

/// 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
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)
}

// Tags: unusual-io
fn main() {
    let n: usize = getline().trim().parse().unwrap();
    let h: Vec<usize> = getline().trim().split(" ").map(|x| x.parse().unwrap()).collect();
    eprintln!("H  = {:?}", h);
    if h[0] == 0 {
        println!("1");
        return;
    }
    let m = h.len();
    let mut s = m - 1;
    for i in 0..m {
        s += h[i];
    }
    if s > n {
        println!("NA");
        return;
    }
    let (fac, invfac) = fact_init(n + 1);
    println!("{}", fac[n - s + m] * invfac[m] * invfac[n - s]);
}
0