結果
問題 |
No.314 ケンケンパ
|
ユーザー |
![]() |
提出日時 | 2017-11-14 22:04:30 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 33 ms / 1,000 ms |
コード長 | 1,535 bytes |
コンパイル時間 | 654 ms |
コンパイル使用メモリ | 89,196 KB |
実行使用メモリ | 128,156 KB |
最終ジャッジ日時 | 2024-11-25 02:15:53 |
合計ジャッジ時間 | 1,354 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
ソースコード
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <bitset> # include <complex> # include <numeric> # include <tuple> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr int INF = 2000000000; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; const double PI = acos(-1); int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; #define ALL(x) (x).begin(),(x).end() #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define mp make_pair #define eb emplace_back typedef pair<LL, double> P; typedef pair<P, P> PP; const LL MOD = 1000000000+7; LL dp[1010110][4][4]; int main() { dp[0][0][0] = 1; int n; cin >> n; for (int i = 1; i <= n; i++) { if (i == 1) { dp[1][1][0] += dp[0][0][0]; } else if (i == 2) { dp[2][1][1] += dp[1][1][0]; dp[2][2][1] += dp[1][1][0]; } else { dp[i][1][1] = (dp[i - 1][1][2]) % MOD; dp[i][1][2] = (dp[i - 1][2][1]) % MOD; dp[i][2][1] = (dp[i - 1][1][1] + dp[i - 1][1][2]) % MOD; } } LL ans = 0; for (int i = 0; i <= 2; i++)for (int j = 0; j <= 2; j++) { ans = (ans + dp[n][i][j]) % MOD; //cout << i << " " << j << " " << dp[n][i][j] << endl; } //system("pause"); cout << ans%MOD << endl; }