結果
問題 | No.1049 Zero (Exhaust) |
ユーザー |
|
提出日時 | 2020-05-08 21:45:57 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 3,910 bytes |
コンパイル時間 | 1,870 ms |
コンパイル使用メモリ | 181,672 KB |
実行使用メモリ | 57,984 KB |
最終ジャッジ日時 | 2024-07-04 00:23:58 |
合計ジャッジ時間 | 3,814 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
/*∫ ∫ ∫ノヽ(_ )(_ )(______ )ヽ(´・ω・)ノ| /UU*/#pragma region macro#include <bits/stdc++.h>typedef long long int64;using namespace std;typedef vector<int> vi;const int MOD = (int)1e9 + 7;const int64 INF = 1LL << 62;const int inf = 1<<30;const char bn = '\n';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; }#define REP(i, n) for (int i = 0; i < (n); i++)#define FOR(i,s,n) for (int i = s; i < (n); i++)#define ALL(obj) (obj).begin(), (obj).end() //コンテナじゃないと使えない!!#define debug(x) cerr << #x << ": " << x << "\n";#define mp make_pairtemplate <typename T>ostream& operator<<(ostream& os, const vector<T> &V){int N = V.size();REP(i,N){os << V[i];if (i!=N-1) os << " ";}os << "\n";return os;}template <typename T,typename S>ostream& operator<<(ostream& os, pair<T,S> const&P){os << "(";os << P.first;os << " , ";os << P.second;os << ")";return os;}template <typename T>ostream& operator<<(ostream& os, set<T> &S){auto it=S.begin();while(it!=S.end()){os << *it;os << " ";it++;}os << "\n";return os;}template <typename T>ostream& operator<<(ostream& os, deque<T> &q){for(auto it=q.begin();it<q.end();it++){os<<*it;os<<" ";}os<<endl;return os;}template <typename T,typename S>ostream& operator<<(ostream& os, map<T,S> const&M){for(auto e:M){os<<e;}os<<endl;return os;}vector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};#pragma endregion//fixed<<setprecision(10)<<ans<<endl;int64 pow(int a,int b,int mod){vector<bool> bit;for(b=b;b>0;b>>=1){bit.push_back(b&1);}vector<int64> fac(bit.size()); fac[0] = a;int64 res = 1;for(int i=1;i<bit.size();i++){fac[i] = (fac[i-1] * fac[i-1])%mod;}for(int i=0;i<bit.size();i++){if(bit[i]) res*=fac[i];res%=mod;}return res;}//mintstruct mint {int64 x;mint(int64 x=0):x((x+2*MOD)%MOD){}mint& operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint& operator-=(const mint a) {if ((x += MOD-a.x) >= MOD) x -= MOD;return *this;}mint& operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}mint operator+(const mint a) const {mint res(*this);return res+=a;}mint operator-(const mint a) const {mint res(*this);return res-=a;}mint operator*(const mint a) const {mint res(*this);return res*=a;}mint pow(int64 t) const {if (!t) return 1;mint a = pow(t>>1);a *= a;if (t&1) a *= *this;return a;}// for prime MODmint inv() const {return pow(MOD-2);}mint& operator/=(const mint a) {return (*this) *= a.inv();}mint operator/(const mint a) const {mint res(*this);return res/=a;}};ostream& operator<<(ostream& os, mint a){os << a.x;return os;}const mint two = 2;mint f(int64 K){if(K==1) return 0;debug(mp(K,two.pow(K)-f(K-1)))return two.pow(K) - f(K-1);}int main(){cin.tie(nullptr);ios::sync_with_stdio(false);int64 P,K; cin >> P >> K;vector<vector<mint>> DP(K+1,vector<mint>(2,0));DP[0][true] = 1;REP(i,K){DP[i+1][true] = DP[i][true] * (P+1) + DP[i][false] * 2;DP[i+1][false] = DP[i][true] * (P-1) + DP[i][false] * (2*P - 2);}auto ans = DP.back()[true];cout << ans << endl;}