結果
問題 | No.533 Mysterious Stairs |
ユーザー |
![]() |
提出日時 | 2020-03-20 13:31:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 104 ms / 5,000 ms |
コード長 | 2,459 bytes |
コンパイル時間 | 2,395 ms |
コンパイル使用メモリ | 200,844 KB |
最終ジャッジ日時 | 2025-01-09 08:05:22 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using VI = vector<int>;using VL = vector<ll>;using PII = std::pair<int, int>;using PLL = std::pair<ll, ll>;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)#define allpt(v) (v).begin(), (v).end()#define allpt_c(v) (v).cbegin(), (v).cend()#define allpt_r(v) (v).rbegin(), (v).rend()const int mod = 1e9 + 7;const string wsp = " ";const string tb = "\t";const string rt = "\n";template <typename T>void show1dvec(const vector<T> &v){if (v.size() == 0)return;int n = v.size() - 1;rep(i, n) cout << v[i] << wsp;cout << v[n] << rt;return;}template <typename T>void show2dvec(const vector<vector<T>> &v){int n = v.size();rep(i, v[i].size()) show1dvec(v[i]);}template <typename T, typename S>void show1dpair(const vector<pair<T, S>> &v){int n = v.size();rep(i, n) cout << v[i].first << wsp << v[i].second << rt;return;}template <typename T, typename S>void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s){int n = v.size();rep(i, n){t.push_back(v[i].first);s.push_back(v[i].second);}return;}template <typename T>void maxvec(vector<T> &v){T s = v[0];int n = v.size();rep(i, n - 1){if (s > v[i + 1]){v[i + 1] = s;}s = v[i + 1];}}template <typename T, typename S>bool myfind(T t, S s){return find(t.cbegin(), t.cend(), s) != t.cend();}const int maxint = 1e9;struct timestamp;vector<int> shortest;vector<vector<pair<int, int>>> connective;int main(){#ifdef DEBUGcout << "DEBUG MODE" << endl;ifstream in("input.txt"); //for debugcin.rdbuf(in.rdbuf()); //for debug#endifconst int nmax = 1000001;int n;cin >> n;vector<vector<ll>> dp(nmax, vector<ll>(4, 0));rep(i, 4) dp[0][i] = 1;dp[1][1] = 1;dp[2][2] = 1;dp[3][1] = dp[3][2] = 1, dp[3][3] = 1;if (n >= 4){rep2(i, 4, n + 1){dp[i][1] = (dp[i - 1][2] + dp[i - 1][3]) % mod;dp[i][2] = (dp[i - 2][1] + dp[i - 2][3]) % mod;dp[i][3] = (dp[i - 3][1] + dp[i - 3][2]) % mod;}}cout << (dp[n][1] + dp[n][2] + dp[n][3]) % mod << rt;return 0;}