結果
問題 | No.314 ケンケンパ |
ユーザー |
![]() |
提出日時 | 2019-03-30 11:15:47 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 90 ms / 1,000 ms |
コード長 | 2,548 bytes |
コンパイル時間 | 1,695 ms |
コンパイル使用メモリ | 170,600 KB |
実行使用メモリ | 57,856 KB |
最終ジャッジ日時 | 2024-11-08 09:37:49 |
合計ジャッジ時間 | 2,844 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
ソースコード
#include "bits/stdc++.h"using namespace std;#ifdef _DEBUG#include "dump.hpp"#else#define dump(...)#endif//#define int long long#define rep(i,a,b) for(int i=(a);i<(b);i++)#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)#define all(c) begin(c),end(c)const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;const int MOD = 1'000'000'007;template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }template<int MOD>struct ModInt {static const int kMod = MOD;unsigned x;ModInt() :x(0) {}ModInt(signed x_) { x_ %= MOD; if (x_ < 0)x_ += MOD; x = x_; }ModInt(signed long long x_) { x_ %= MOD; if (x_ < 0)x_ += MOD; x = x_; }int get()const { return (int)x; }ModInt &operator+=(ModInt m) { if ((x += m.x) >= MOD)x -= MOD; return *this; }ModInt &operator-=(ModInt m) { if ((x += MOD - m.x) >= MOD)x -= MOD; return *this; }ModInt &operator*=(ModInt m) { x = (unsigned long long)x*m.x%MOD; return *this; }ModInt &operator/=(ModInt m) { return *this *= m.inverse(); }ModInt operator+(ModInt m)const { return ModInt(*this) += m; }ModInt operator-(ModInt m)const { return ModInt(*this) -= m; }ModInt operator*(ModInt m)const { return ModInt(*this) *= m; }ModInt operator/(ModInt m)const { return ModInt(*this) /= m; }ModInt operator-()const { return ModInt(kMod - x); }bool operator==(ModInt m)const { return x == m.x; }bool operator!=(ModInt m)const { return x != m.x; }ModInt inverse()const {signed a = x, b = MOD, u = 1, v = 0;while (b) {signed t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}if (u < 0)u += MOD;return ModInt(u);}};template<int MOD>ostream &operator<<(ostream &os, const ModInt<MOD> &m) { return os << m.x; }template<int MOD>istream &operator>>(istream &is, ModInt<MOD> &m) { signed long long s; is >> s; m = ModInt<MOD>(s); return is; };using mint = ModInt<MOD>;template<int MOD>ModInt<MOD> pow(ModInt<MOD> a, unsigned long long k) {ModInt<MOD> r = 1;while (k) {if (k & 1)r *= a;a *= a;k >>= 1;}return r;}signed main() {cin.tie(0);ios::sync_with_stdio(false);int N; cin >> N;vector<vector<mint>> dp(N + 1, vector<mint>(3));dp[0][0] = 1;rep(i, 0, N) {rep(j, 0, 3) {if (j < 2)dp[i + 1][j + 1] += dp[i][j];if (j > 0)dp[i + 1][0] += dp[i][j];}}dump(dp[N]);cout << dp[N][0] + dp[N][1] + dp[N][2] << endl;return 0;}