結果

問題 No.1011 Infinite Stairs
ユーザー oevloevl
提出日時 2020-04-19 11:55:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 285 ms / 2,000 ms
コード長 3,463 bytes
コンパイル時間 2,018 ms
コンパイル使用メモリ 204,388 KB
実行使用メモリ 215,936 KB
最終ジャッジ日時 2024-07-17 12:05:41
合計ジャッジ時間 6,702 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
6,912 KB
testcase_01 AC 8 ms
8,832 KB
testcase_02 AC 244 ms
184,832 KB
testcase_03 AC 268 ms
205,312 KB
testcase_04 AC 285 ms
215,936 KB
testcase_05 AC 285 ms
215,808 KB
testcase_06 AC 4 ms
6,940 KB
testcase_07 AC 152 ms
116,608 KB
testcase_08 AC 4 ms
6,940 KB
testcase_09 AC 6 ms
7,424 KB
testcase_10 AC 68 ms
53,888 KB
testcase_11 AC 258 ms
194,048 KB
testcase_12 AC 70 ms
53,376 KB
testcase_13 AC 138 ms
105,984 KB
testcase_14 AC 87 ms
67,968 KB
testcase_15 AC 205 ms
156,672 KB
testcase_16 AC 254 ms
192,640 KB
testcase_17 AC 269 ms
203,904 KB
testcase_18 AC 197 ms
149,632 KB
testcase_19 AC 52 ms
41,216 KB
testcase_20 AC 51 ms
40,576 KB
testcase_21 AC 126 ms
97,536 KB
testcase_22 AC 225 ms
172,160 KB
testcase_23 AC 114 ms
88,448 KB
testcase_24 AC 149 ms
116,736 KB
testcase_25 AC 228 ms
173,696 KB
testcase_26 AC 90 ms
68,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

template<int64_t MOD> class ModInt {
public:
    int64_t x;
    constexpr ModInt() : x(0) {}
    constexpr ModInt(int64_t v) : x((v % MOD + MOD) % MOD) {}
    constexpr ModInt operator - () const noexcept { return x ? MOD - x : 0;}
    constexpr ModInt operator + (const ModInt a) const noexcept { return ModInt(*this) += a;}
    constexpr ModInt operator - (const ModInt a) const noexcept { return ModInt(*this) -= a;}
    constexpr ModInt operator * (const ModInt a) const noexcept { return ModInt(*this) *= a;}
    constexpr ModInt operator / (const ModInt a) const noexcept { return ModInt(*this) /= a;}
    constexpr ModInt operator / (const int64_t a) const noexcept { return ModInt(*this) /= a;}
    constexpr ModInt operator += (const ModInt a) noexcept {
        x += a.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    constexpr ModInt operator += (const int64_t a) noexcept {
        auto hs = ModInt<MOD>(a);
        (*this) += hs;
        return *this;
    }
    constexpr ModInt operator -= (const ModInt a) noexcept {
        if (x < a.x) x += MOD;
        x -= a.x;
        return *this;
    }
    constexpr ModInt operator -= (const int64_t a) noexcept {
        auto hs = ModInt<MOD>(a);
        (*this) -= hs;
        return *this;
    }
    constexpr ModInt operator *= (const ModInt a) noexcept {
        x = x * a.x % MOD;
        return *this;
    }
    constexpr ModInt operator *= (const int64_t a) noexcept {
        auto hs = ModInt<MOD>(a);
        (*this) *= hs;
        return *this;
    }
    constexpr ModInt &operator /= (ModInt a) noexcept {
        int64_t exp = MOD - 2;
        while (exp > 0) {
            if (exp & 1ul) *this *= a;
            a *= a;
            exp >>= 1ul;
        }
        return *this;
    }
    constexpr ModInt &operator /= (int64_t a) noexcept {
        auto hs = ModInt<MOD>(a);
        (*this) /= hs;
        return *this;
    }
    constexpr ModInt &operator ++ () noexcept {
        if (++x >= MOD) x -= MOD;
        return *this;
    }
    constexpr ModInt &operator -- () noexcept {
        if (x-- == 0) x += MOD;
        return *this;
    }
    constexpr bool operator < (const ModInt a) const noexcept { return x < a.x;}
    constexpr bool operator == (const ModInt a) const noexcept { return this->x == a.x;}
    constexpr bool operator != (const ModInt a) const noexcept { return !(*this == a);}
    friend istream &operator >> (istream &in, ModInt &m) {
        in >> m.x;
        if (m.x < 0) m.x += MOD;
        m.x %= MOD;
        return in;
    }
    friend ostream &operator << (ostream &out, const ModInt &p) { return out << p.x;}
    constexpr ModInt pow(int64_t p) const {
        ModInt ret(1);
        ModInt mul(x);
        while (p > 0) {
            if (p & 1ul) ret *= mul;
            mul *= mul;
            p >>= 1ul;
        }
        return ret;
    }
};

const int64_t MOD = 1000000007LL;
using mint = ModInt<MOD>;

int main() {
    int N, d, K;
    cin >> N >> d >> K;
    const int M = 90009;
    vector<vector<mint>> dp(N + 1, vector<mint>(M + 2));
    dp[0][0] = 1;
    for(int i = 1; i <= N; ++i) {
        for(int j = 0; j < M; ++j) dp[i - 1][j + 1] += dp[i - 1][j];
        for(int j = 1; j <= M; ++j) {
            if(j - d - 1 < 0) dp[i][j] = dp[i - 1][j - 1];
            else dp[i][j] = dp[i - 1][j - 1] - dp[i - 1][j - d - 1];
        }
    }
    cout << dp[N][K] << '\n';
    return 0;
}
0