結果

問題 No.978 Fibonacci Convolution Easy
ユーザー akakimidoriakakimidori
提出日時 2020-01-31 21:53:55
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 22 ms / 2,000 ms
コード長 2,899 bytes
コンパイル時間 20,362 ms
コンパイル使用メモリ 390,484 KB
実行使用メモリ 9,824 KB
最終ジャッジ日時 2024-09-18 20:56:41
合計ジャッジ時間 13,701 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 9 ms
6,816 KB
testcase_02 AC 5 ms
6,944 KB
testcase_03 AC 21 ms
9,584 KB
testcase_04 AC 7 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 8 ms
6,940 KB
testcase_07 AC 14 ms
6,940 KB
testcase_08 AC 9 ms
6,944 KB
testcase_09 AC 15 ms
7,424 KB
testcase_10 AC 20 ms
9,616 KB
testcase_11 AC 7 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 8 ms
6,940 KB
testcase_14 AC 3 ms
6,944 KB
testcase_15 AC 8 ms
6,940 KB
testcase_16 AC 22 ms
9,664 KB
testcase_17 AC 20 ms
9,824 KB
testcase_18 AC 1 ms
6,940 KB
testcase_19 AC 0 ms
6,940 KB
testcase_20 AC 0 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin ModInt ----------
const MOD: u32 = 1_000_000_007;

#[derive(Clone, Copy)]
struct ModInt(u32);

impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}

impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}

impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as u32)
    }
}

impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}

impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}

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

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

#[allow(dead_code)]
impl ModInt {
    pub fn new(n: u32) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: u32) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        assert!(self.0 > 0);
        self.pow(MOD - 2)
    }
}
// ---------- end ModInt ----------

fn run() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    let mut it = s.trim().split_whitespace();
    let n: usize = it.next().unwrap().parse().unwrap();
    let p: ModInt = it.next().unwrap().parse().unwrap();
    let mut x = ModInt::zero();
    let mut y = ModInt::one();
    let mut a = vec![];
    for _ in 0..n {
        a.push(x);
        let z = p * y + x;
        x = y;
        y = z;
    }
    let sum = a.iter().fold(ModInt::zero(), |s, a| s + *a);
    let sub = a.iter().fold(ModInt::zero(), |s, a| s + *a * *a);
    let ans = (sum * sum - sub) * ModInt(2).inv() + sub;
    println!("{}", ans);
}

fn main() {
    run();
}
0