結果

問題 No.1259 スイッチ
ユーザー koba-e964koba-e964
提出日時 2021-09-11 16:53:14
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 6,486 bytes
コンパイル時間 12,430 ms
コンパイル使用メモリ 387,036 KB
実行使用メモリ 25,236 KB
最終ジャッジ日時 2024-06-23 01:08:29
合計ジャッジ時間 17,639 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 0 ms
6,812 KB
testcase_02 AC 1 ms
6,812 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 WA -
testcase_07 AC 0 ms
6,940 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 87 ms
15,976 KB
testcase_11 AC 137 ms
23,724 KB
testcase_12 AC 82 ms
15,220 KB
testcase_13 AC 49 ms
9,700 KB
testcase_14 AC 71 ms
12,932 KB
testcase_15 AC 48 ms
9,408 KB
testcase_16 AC 116 ms
20,052 KB
testcase_17 AC 68 ms
12,744 KB
testcase_18 AC 129 ms
22,448 KB
testcase_19 AC 129 ms
22,252 KB
testcase_20 AC 89 ms
16,092 KB
testcase_21 AC 144 ms
24,344 KB
testcase_22 AC 43 ms
8,576 KB
testcase_23 AC 126 ms
21,968 KB
testcase_24 AC 96 ms
16,944 KB
testcase_25 AC 89 ms
16,660 KB
testcase_26 AC 143 ms
24,688 KB
testcase_27 AC 117 ms
20,372 KB
testcase_28 AC 92 ms
16,616 KB
testcase_29 AC 115 ms
20,208 KB
testcase_30 AC 14 ms
9,268 KB
testcase_31 AC 19 ms
12,996 KB
testcase_32 AC 10 ms
6,940 KB
testcase_33 AC 27 ms
17,100 KB
testcase_34 AC 15 ms
10,020 KB
testcase_35 AC 21 ms
13,612 KB
testcase_36 AC 19 ms
12,588 KB
testcase_37 AC 19 ms
11,884 KB
testcase_38 AC 18 ms
11,080 KB
testcase_39 AC 26 ms
16,312 KB
testcase_40 AC 26 ms
16,604 KB
testcase_41 AC 22 ms
14,024 KB
testcase_42 AC 25 ms
16,800 KB
testcase_43 AC 17 ms
10,776 KB
testcase_44 AC 25 ms
16,000 KB
testcase_45 AC 27 ms
17,440 KB
testcase_46 AC 16 ms
10,316 KB
testcase_47 AC 28 ms
17,256 KB
testcase_48 AC 13 ms
9,156 KB
testcase_49 AC 26 ms
16,768 KB
testcase_50 AC 78 ms
14,444 KB
testcase_51 AC 42 ms
8,704 KB
testcase_52 AC 135 ms
23,696 KB
testcase_53 AC 60 ms
11,524 KB
testcase_54 AC 139 ms
23,432 KB
testcase_55 AC 41 ms
8,320 KB
testcase_56 AC 70 ms
12,700 KB
testcase_57 AC 124 ms
21,920 KB
testcase_58 AC 86 ms
15,548 KB
testcase_59 AC 104 ms
18,692 KB
testcase_60 AC 148 ms
25,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

use std::cmp::*;
// 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, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/// 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 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!(n: usize, k: usize, m: usize1);
    assert_eq!(std::mem::size_of::<usize>(), 8);
    let nn = MInt::new(n as i64);
    let (fac, invfac) = fact_init(n + 1);
    let mut tot = MInt::new(0);
    if m == 0 {
        for per in 1..n + 1 {
            if k % per == 0 {
                tot += fac[n - 1] * invfac[n - per] * nn.pow((n - per) as i64);
            }
        }
    } else {
        for per in 2..n + 1 {
            let r = k % per;
            let tmp = fac[n - 2] * invfac[n - per] * nn.pow((n - per) as i64);
            if r == 0 {
                continue;
            }
            tot += tmp;
        }
        let mut acc = vec![MInt::new(0); n];
        let mut cur = MInt::new(1);
        for i in 0..n - 1 {
            acc[i + 1] = acc[i] + invfac[i] * cur;
            cur *= nn;
        }
        for per in 1..n {
            let hi = min(n - 1 - per, k - 1);
            // tmp = (n - 1 - per)!/(n - 1 - per)! * n^{n - 1 - per} + .. + (n - 1 - per)!/(n - 1 - per - hi)! * n^{n - 1 - per - hi}
            let tmp = fac[n - 1 - per] * (acc[n - per] - acc[n - 1 - per - hi]);
            tot += tmp * fac[n - 2] * invfac[per - 1] * invfac[n - per - 1] * fac[per - 1];
        }
        if k < n {
            for per in 1..n - k {
                let tmp = fac[n - 2] * invfac[per];
                tot += tmp * fac[per - 1];
            }
        }
    }
    println!("{}", tot);
}
0