結果

問題 No.533 Mysterious Stairs
ユーザー はまやんはまやんはまやんはまやん
提出日時 2017-06-23 22:54:32
言語 C++14
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 21 ms / 5,000 ms
コード長 2,778 Byte
コンパイル時間 1,241 ms
使用メモリ 19,304 KB
最終ジャッジ日時 2022-08-17 09:01:17
合計ジャッジ時間 2,932 ms
ジャッジサーバーID
(参考情報)
judge12 / judge16
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 15 ms
19,232 KB
testcase_01 AC 16 ms
19,172 KB
testcase_02 AC 16 ms
19,172 KB
testcase_03 AC 16 ms
19,164 KB
testcase_04 AC 16 ms
19,204 KB
testcase_05 AC 17 ms
19,172 KB
testcase_06 AC 17 ms
19,260 KB
testcase_07 AC 15 ms
19,172 KB
testcase_08 AC 16 ms
19,300 KB
testcase_09 AC 16 ms
19,164 KB
testcase_10 AC 17 ms
19,236 KB
testcase_11 AC 17 ms
19,264 KB
testcase_12 AC 16 ms
19,172 KB
testcase_13 AC 16 ms
19,256 KB
testcase_14 AC 16 ms
19,240 KB
testcase_15 AC 17 ms
19,252 KB
testcase_16 AC 16 ms
19,172 KB
testcase_17 AC 17 ms
19,208 KB
testcase_18 AC 17 ms
19,264 KB
testcase_19 AC 15 ms
19,172 KB
testcase_20 AC 17 ms
19,252 KB
testcase_21 AC 16 ms
19,232 KB
testcase_22 AC 18 ms
19,172 KB
testcase_23 AC 20 ms
19,240 KB
testcase_24 AC 21 ms
19,304 KB
testcase_25 AC 17 ms
19,248 KB
testcase_26 AC 21 ms
19,260 KB
testcase_27 AC 17 ms
19,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/




int N;
mint dp[1010101][4];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    dp[0][0] = 1;

    rep(i, 0, N) rep(j, 0, 4) {
        rep(k, 1, 4) if(k != j){
            dp[i + k][k] += dp[i][j];
        }
    }

    mint ans = 0;
    rep(j, 0, 4) ans += dp[N][j];
    cout << ans.get() << endl;
}
0