結果

問題 No.980 Fibonacci Convolution Hard
ユーザー koba-e964koba-e964
提出日時 2021-10-08 11:08:01
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 80 ms / 2,000 ms
コード長 4,681 bytes
コンパイル時間 14,274 ms
コンパイル使用メモリ 387,536 KB
実行使用メモリ 34,856 KB
最終ジャッジ日時 2024-07-23 03:19:17
合計ジャッジ時間 17,405 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
34,676 KB
testcase_01 AC 78 ms
34,748 KB
testcase_02 AC 80 ms
34,660 KB
testcase_03 AC 78 ms
34,588 KB
testcase_04 AC 79 ms
34,512 KB
testcase_05 AC 80 ms
34,696 KB
testcase_06 AC 79 ms
34,592 KB
testcase_07 AC 80 ms
34,684 KB
testcase_08 AC 79 ms
34,636 KB
testcase_09 AC 78 ms
34,800 KB
testcase_10 AC 78 ms
34,668 KB
testcase_11 AC 79 ms
34,856 KB
testcase_12 AC 79 ms
34,644 KB
testcase_13 AC 79 ms
34,652 KB
testcase_14 AC 80 ms
34,724 KB
testcase_15 AC 79 ms
34,584 KB
testcase_16 AC 53 ms
34,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($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! {
        p: i64,
        q: usize,
        v: [usize; q],
    }
    const W: usize = 2_000_010;
    let mut dp = vec![MInt::new(0); W];
    dp[0] = 2.into();
    dp[1] = p.into();
    for i in 2..W {
        dp[i] = dp[i - 1] * p + dp[i - 2];
    }
    let mut acc = vec![MInt::new(0); W];
    acc[0] = dp[0];
    acc[1] = dp[1] * 2;
    for i in 2..W {
        acc[i] = -acc[i - 2] + dp[i] * 2;
    }
    let fac = MInt::new(p * p + 4).inv();
    for q in v {
        let q = q - 2;
        let mut tmp = dp[q] * (q as i64 + 1);
        tmp -= acc[q];
        puts!("{}\n", tmp * fac);
    }
}
0