結果
問題 | No.1049 Zero (Exhaust) |
ユーザー | rniya |
提出日時 | 2020-05-30 00:32:25 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 3,310 bytes |
コンパイル時間 | 1,502 ms |
コンパイル使用メモリ | 168,660 KB |
実行使用メモリ | 57,832 KB |
最終ジャッジ日時 | 2023-08-06 06:58:59 |
合計ジャッジ時間 | 4,412 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 58 ms
40,384 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 47 ms
33,320 KB |
testcase_06 | AC | 83 ms
57,832 KB |
testcase_07 | AC | 12 ms
9,860 KB |
testcase_08 | AC | 26 ms
19,136 KB |
testcase_09 | AC | 63 ms
43,968 KB |
testcase_10 | AC | 68 ms
47,576 KB |
testcase_11 | AC | 70 ms
47,980 KB |
testcase_12 | AC | 81 ms
54,896 KB |
testcase_13 | AC | 20 ms
14,504 KB |
testcase_14 | AC | 38 ms
26,196 KB |
testcase_15 | AC | 60 ms
41,108 KB |
testcase_16 | AC | 49 ms
33,924 KB |
testcase_17 | AC | 51 ms
35,284 KB |
testcase_18 | AC | 71 ms
48,688 KB |
testcase_19 | AC | 60 ms
41,336 KB |
testcase_20 | AC | 27 ms
18,808 KB |
testcase_21 | AC | 62 ms
42,556 KB |
testcase_22 | AC | 35 ms
25,140 KB |
testcase_23 | AC | 85 ms
57,784 KB |
testcase_24 | AC | 85 ms
57,816 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const long long MOD=1e9+7; template<uint_fast64_t Modulus> class modint{ using u64=uint_fast64_t; public: u64 a; constexpr modint(const u64 x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){} constexpr u64 &value() noexcept{return a;} constexpr const u64 &value() const noexcept{return a;} constexpr modint &operator+=(const modint &rhs) noexcept{ a+=rhs.a; if (a>=Modulus) a-=Modulus; return *this; } constexpr modint operator+(const modint &rhs) const noexcept{ return modint(*this)+=rhs; } constexpr modint &operator++() noexcept{ return ++a,*this; } constexpr modint operator++(int) noexcept{ modint t=*this; return ++a,t; } constexpr modint &operator-=(const modint &rhs) noexcept{ if (a<rhs.a) a+=Modulus; a-=rhs.a; return *this; } constexpr modint operator-(const modint &rhs) const noexcept{ return modint(*this)-=rhs; } constexpr modint &operator--() noexcept{ return --a,*this; } constexpr modint operator--(int) noexcept{ modint t=*this; return --a,t; } constexpr modint &operator*=(const modint &rhs) noexcept{ a=a*rhs.a%Modulus; return *this; } constexpr modint operator*(const modint &rhs) const noexcept{ return modint(*this)*=rhs; } constexpr modint &operator/=(modint rhs) noexcept{ u64 exp=Modulus-2; while(exp){ if (exp&1) *this*=rhs; rhs*=rhs; exp>>=1; } return *this; } constexpr modint operator/(const modint &rhs) const noexcept{ return modint(*this)/=rhs; } constexpr modint operator-() const noexcept{ return modint(Modulus-a); } constexpr bool operator==(const modint &rhs) const noexcept{ return a==rhs.a; } constexpr bool operator!=(const modint &rhs) const noexcept{ return a!=rhs.a; } constexpr bool operator!() const noexcept{return !a;} friend constexpr modint pow(modint rhs,long long exp) noexcept{ modint res{1}; while(exp){ if (exp&1) res*=rhs; rhs*=rhs; exp>>=1; } return res; } template<class T> friend constexpr modint operator+(T x,modint y) noexcept{ return modint(x)+y; } template<class T> friend constexpr modint operator-(T x,modint y) noexcept{ return modint(x)-y; } template<class T> friend constexpr modint operator*(T x,modint y) noexcept{ return modint(x)*y; } template<class T> friend constexpr modint operator/(T x,modint y) noexcept{ return modint(x)/y; } friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{ return s << rhs.a; } friend istream &operator>>(istream &s,modint &rhs) noexcept{ u64 a; rhs=modint{(s >> a,a)}; return s; } }; using mint=modint<MOD>; int main(){ cin.tie(0); ios::sync_with_stdio(false); int P,K; cin >> P >> K; vector<vector<mint>> dp(K+1,vector<mint>(2,0)); dp[0][0]=1; for (int i=0;i<K;++i){ dp[i+1][0]+=dp[i][0]*(P+1)+dp[i][1]*2; dp[i+1][1]+=dp[i][0]*(P-1)+dp[i][1]*(2*P-2); } cout << dp[K][0] << '\n'; }