結果

問題 No.1049 Zero (Exhaust)
ユーザー penguinshunyapenguinshunya
提出日時 2020-05-08 21:56:59
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 3,082 bytes
コンパイル時間 2,360 ms
コンパイル使用メモリ 193,472 KB
最終ジャッジ日時 2025-01-10 08:38:51
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())
using namespace std;
using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <int mod>
struct ModInt {
int x;
ModInt(): x(0) {}
ModInt(long long a) { x = a % mod; if (x < 0) x += mod; }
ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; }
ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; }
ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt inverse() {
int a = x, b = mod, u = 1, v = 0;
while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }
return ModInt(u);
}
#define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; }
op(+, +=) op(-, -=) op(*, *=) op(/, /=)
#undef op
friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }
};
using mint = ModInt<1000000007>;
mint dp[1000001][2];
void solve() {
int p, k;
cin >> p >> k;
dp[0][0] = 1;
rep(i, k) {
dp[i + 1][0] += dp[i][0] * (p + 1);
dp[i + 1][1] += dp[i][0] * (p - 1);
dp[i + 1][0] += dp[i][1] * 2;
dp[i + 1][1] += dp[i][1] * (2 * p - 2);
}
cout << dp[k][0] << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0