結果

問題 No.1011 Infinite Stairs
ユーザー rniyarniya
提出日時 2020-03-20 21:45:16
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 293 ms / 2,000 ms
コード長 3,877 bytes
コンパイル時間 1,522 ms
コンパイル使用メモリ 169,800 KB
実行使用メモリ 227,540 KB
最終ジャッジ日時 2023-09-24 10:55:26
合計ジャッジ時間 3,877 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
14,632 KB
testcase_01 AC 7 ms
14,636 KB
testcase_02 AC 11 ms
17,564 KB
testcase_03 AC 195 ms
154,844 KB
testcase_04 AC 39 ms
38,436 KB
testcase_05 AC 293 ms
227,540 KB
testcase_06 AC 7 ms
14,636 KB
testcase_07 AC 10 ms
16,296 KB
testcase_08 AC 7 ms
14,700 KB
testcase_09 AC 7 ms
14,588 KB
testcase_10 AC 9 ms
15,772 KB
testcase_11 AC 46 ms
43,168 KB
testcase_12 AC 9 ms
15,560 KB
testcase_13 AC 32 ms
32,136 KB
testcase_14 AC 8 ms
15,024 KB
testcase_15 AC 40 ms
37,688 KB
testcase_16 AC 146 ms
112,696 KB
testcase_17 AC 19 ms
22,912 KB
testcase_18 AC 84 ms
71,536 KB
testcase_19 AC 9 ms
15,512 KB
testcase_20 AC 8 ms
15,164 KB
testcase_21 AC 40 ms
38,016 KB
testcase_22 AC 71 ms
60,904 KB
testcase_23 AC 45 ms
42,368 KB
testcase_24 AC 49 ms
45,080 KB
testcase_25 AC 75 ms
64,360 KB
testcase_26 AC 21 ms
24,684 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

template<uint_fast64_t Modulus> class modint{
    using u64=uint_fast64_t;
    public:
    u64 a;
    constexpr modint(const u64 x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){}
    constexpr u64 &value() noexcept{return a;}
    constexpr const u64 &value() const noexcept{return a;}
    constexpr modint &operator+=(const modint &rhs) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX=5e5+10;
vector<mint> fac(MAX),finv(MAX),inv(MAX);
void COMinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for (int i=2;i<MAX;++i){
        fac[i]=fac[i-1]*i;
        inv[i]=-inv[MOD%i]*(MOD/i);
        finv[i]=finv[i-1]*inv[i];
    }
}
mint COM(int n,int k){
    if (n<k||n<0||k<0) return 0;
    return fac[n]*finv[k]*finv[n-k];
}

//Be careful with the value of MAX and conducting COMinit()

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,d,K; cin >> N >> d >> K;
    vector<vector<mint>> dp(N+1,vector<mint>(K+1,0));
    vector<mint> sum(K+2,1);
    dp[0][0]=1; sum[0]=0;
    for (int i=0;i<N;++i){
        for (int j=K;j>=0;--j){
            dp[i+1][j]+=sum[j]-sum[max(0,j-d)];
            sum[j+1]=dp[i+1][j];
        }
        for (int j=0;j<K+1;++j) sum[j+1]+=sum[j];
    }
    cout << dp[N][K] << '\n';
}
0