結果
問題 | No.1011 Infinite Stairs |
ユーザー | micheeeeell1001 |
提出日時 | 2020-03-20 21:59:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 72 ms / 2,000 ms |
コード長 | 4,251 bytes |
コンパイル時間 | 2,380 ms |
コンパイル使用メモリ | 201,132 KB |
実行使用メモリ | 5,476 KB |
最終ジャッジ日時 | 2023-08-21 16:30:46 |
合計ジャッジ時間 | 3,231 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 3 ms
4,380 KB |
testcase_03 | AC | 47 ms
4,772 KB |
testcase_04 | AC | 9 ms
4,384 KB |
testcase_05 | AC | 72 ms
5,476 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 11 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 7 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 9 ms
4,376 KB |
testcase_16 | AC | 34 ms
4,680 KB |
testcase_17 | AC | 4 ms
4,376 KB |
testcase_18 | AC | 20 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,376 KB |
testcase_20 | AC | 2 ms
4,376 KB |
testcase_21 | AC | 9 ms
4,376 KB |
testcase_22 | AC | 17 ms
4,376 KB |
testcase_23 | AC | 11 ms
4,376 KB |
testcase_24 | AC | 11 ms
4,376 KB |
testcase_25 | AC | 18 ms
4,380 KB |
testcase_26 | AC | 5 ms
4,380 KB |
ソースコード
#include<bits/stdc++.h> #include<iostream> #include<cstdio> #include<vector> #include<string> #include<algorithm> #include<map> using namespace std; #define rep(i,x) for(ll i = 0; i < (ll)(x); i++) #define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--) #define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++) #define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--) #define debug(x) cerr << #x << ": " << (x) << "\n"; #define all(x) (x).begin(), (x).end() typedef long long ll; typedef long double ld; typedef pair<int,int> P; typedef pair<ll,ll> Pll; typedef vector<ll> vl; typedef vector<vector<ll>> vvl; typedef vector<vector<vector<ll>>> vvvl; const ll INF = numeric_limits<ll>::max()/4; const int n_max = 1e5+10; template<std::int_fast64_t Modulus> class modint { using i64 = int_fast64_t; public: i64 a; constexpr modint(const i64 x = 0) noexcept { this -> a = x % Modulus; if(a < 0){ a += Modulus; } } // constexpr i64 &value() const noexcept {return a;} constexpr const i64 &value() const noexcept {return a;} constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if(a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if(a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { i64 a_ = rhs.a, b = Modulus, u = 1, v = 0; while(b){ i64 t = a_/b; a_ -= t * b; swap(a_,b); u -= t * v; swap(u,v); } a = a * u % Modulus; if(a < 0) a += Modulus; return *this; } // 自前実装 constexpr bool operator==(const modint rhs) noexcept { return a == rhs.a; } constexpr bool operator!=(const modint rhs) noexcept { return a != rhs.a; } constexpr bool operator>(const modint rhs) noexcept { return a > rhs.a; } constexpr bool operator>=(const modint rhs) noexcept { return a >= rhs.a; } constexpr bool operator<(const modint rhs) noexcept { return a < rhs.a; } constexpr bool operator<=(const modint rhs) noexcept { return a <= rhs.a; } constexpr modint& operator++() noexcept { return (*this) += modint(1); } constexpr modint operator++(int) { modint tmp(*this); operator++(); return tmp; } constexpr modint& operator--() noexcept { return (*this) -= modint(1); } constexpr modint operator--(int) { modint tmp(*this); operator--(); return tmp; } template<typename T> friend constexpr modint modpow(modint &mt, T n) noexcept { if(n < 0){ modint t = (modint(1) / mt); return modpow(t, -n); } modint res = 1; while(n){ if(n & 1)res *= mt; mt *= mt; n /= 2; } return res; } }; const ll MOD = 1e9+7; using mint = modint<MOD>; // 標準入出力対応 std::ostream &operator<<(std::ostream &out, const modint<MOD> &m) { out << m.a; return out; } std::istream &operator>>(std::istream &in, modint<MOD> &m) { ll a; in >> a; m = mint(a); return in; } int main(){ ll n,d,k; cin >> n >> d >> k; mint a = 0; mint dp[2][k] = {}; dp[0][0] = 1; rep(i,n){ vector<mint> sum(k+1, 0); rep(j,k)sum[j+1] = sum[j] + dp[i & 1][j]; rep(j,k+1){ dp[(i+1) & 1][j] = sum[j] - sum[max(0LL,j-d)]; } } cout << dp[n & 1][k] << endl; }