結果
問題 | No.1049 Zero (Exhaust) |
ユーザー |
![]() |
提出日時 | 2020-05-08 21:48:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 3,469 bytes |
コンパイル時間 | 1,390 ms |
コンパイル使用メモリ | 130,008 KB |
最終ジャッジ日時 | 2025-01-10 08:33:28 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cstdint>#include <cstdlib>#include <cmath>#include <complex>#include <chrono>#include <deque>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <memory>#include <numeric>#include <queue>#include <set>#include <stack>#include <string>#include <unordered_map>#include <vector>#include <random>#include <utility>#include <limits>#include <list>/* template start */#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)#define all(i) i.begin(), i.end()#ifdef LOCAL#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out(){std::cerr<<std::endl;}template<typename Head,typename... Tail>void debug_out(Head h,Tail... t){std::cerr<<" "<<h;if(sizeof...(t)>0)std::cout<<" :";debug_out(t...);}template <typename T1, typename T2>std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {return os << pa.first << " " << pa.second;}template <typename T>std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template<typename T1,typename T2>inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}template<typename T1,typename T2>inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}long long pow_mod(long long a, long long b, long long mod=-1) {if(b==0)return 1;if ((a == 0)||(mod!=-1&&(a+mod)%mod==0))return 0;long long x = 1;while (b > 0) {if (b & 1)x = (mod!=-1)?(x * a) % mod:x*a;a = (mod!=-1)?(a * a) % mod:a*a;b >>= 1;}return x;}template <std::uint_fast64_t Modulus> class modint {using u64 = std::uint_fast64_t;public:u64 a;constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}constexpr u64 &value() noexcept { return a; }constexpr const u64 &value() const noexcept { return a; }constexpr modint operator+(const modint rhs) const noexcept {return modint(*this) += rhs;}constexpr modint operator-(const modint rhs) const noexcept {return modint(*this) -= rhs;}constexpr modint operator*(const modint rhs) const noexcept {return modint(*this) *= rhs;}constexpr modint operator/(const modint rhs) const noexcept {return modint(*this) /= rhs;}constexpr modint &operator+=(const modint rhs) noexcept {a += rhs.a;if (a >= Modulus) {a -= Modulus;}return *this;}constexpr modint &operator-=(const modint rhs) noexcept {if (a < rhs.a) {a += Modulus;}a -= rhs.a;return *this;}constexpr modint &operator*=(const modint rhs) noexcept {a = a * rhs.a % Modulus;return *this;}constexpr modint &operator/=(modint rhs) noexcept {u64 exp = Modulus - 2;while (exp) {if (exp % 2) {*this *= rhs;}rhs *= rhs;exp /= 2;}return *this;}};/* template end */using ll = long long;using P=std::pair<long long,long long>;constexpr ll MOD=1e9+7;using mint=modint<MOD>;int main() {std::cin.tie(nullptr);std::ios::sync_with_stdio(false);ll p,k;std::cin>>p>>k;mint a=1,b=0;rep(i,0,k){mint na=a*(p+1)+b*(p-1)*2;mint nb=a+b*(p-1)*2;a=na;b=nb;}std::cout<<a.value()<<"\n";return 0;}