結果

問題 No.980 Fibonacci Convolution Hard
ユーザー 👑 はまやんはまやんはまやんはまやん
提出日時 2020-02-01 13:09:05
言語 C++17(1z)
(gcc 10.2.0 + boost 1.73.0)
結果
AC  
実行時間 81 ms / 2,000 ms
コード長 3,296 Byte
コンパイル時間 1,849 ms
使用メモリ 11,316 KB
最終ジャッジ日時 2021-02-20 19:14:07
合計ジャッジ時間 6,173 ms
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 81 ms
11,156 KB
testcase_01 AC 78 ms
11,148 KB
testcase_02 AC 78 ms
11,236 KB
testcase_03 AC 81 ms
11,096 KB
testcase_04 AC 79 ms
11,200 KB
testcase_05 AC 77 ms
11,100 KB
testcase_06 AC 78 ms
11,160 KB
testcase_07 AC 78 ms
11,052 KB
testcase_08 AC 79 ms
11,152 KB
testcase_09 AC 79 ms
11,096 KB
testcase_10 AC 80 ms
11,096 KB
testcase_11 AC 79 ms
11,096 KB
testcase_12 AC 77 ms
11,252 KB
testcase_13 AC 77 ms
11,152 KB
testcase_14 AC 75 ms
11,144 KB
testcase_15 AC 80 ms
11,160 KB
testcase_16 AC 67 ms
11,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
	static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
	ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
	ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
	int get() const { return (int)x; }
	ModInt& operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt& operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt& operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
	ModInt& operator/=(ModInt that) { return *this *= that.inverse(); }
	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
	ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
	ModInt inverse() const {
		long long a = x, b = MOD, u = 1, v = 0;
		while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
		return ModInt(u);
	}
	bool operator==(ModInt that) const { return x == that.x; }
	bool operator!=(ModInt that) const { return x != that.x; }
	ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
	ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;
}
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int p, Q;
mint B[2010101];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> p >> Q;
	
	B[4] = 1;
	rep(i, 5, 2010101) {
		B[i] = B[i - 1] * 2 * p
			+ (mint(2) - mint(p) * mint(p)) * B[i - 2]
			- B[i - 3] * 2 * p
			- B[i - 4];
	}

	rep(_, 0, Q) {
		int q; cin >> q;
		printf("%d\n", B[q].get());
	}
}





0