結果
問題 | No.1011 Infinite Stairs |
ユーザー | cutmdo |
提出日時 | 2020-03-21 19:49:07 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 297 ms / 2,000 ms |
コード長 | 3,651 bytes |
コンパイル時間 | 1,286 ms |
コンパイル使用メモリ | 136,500 KB |
実行使用メモリ | 217,488 KB |
最終ジャッジ日時 | 2023-09-24 11:07:01 |
合計ジャッジ時間 | 4,494 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 10 ms
9,452 KB |
testcase_03 | AC | 197 ms
144,384 KB |
testcase_04 | AC | 297 ms
217,488 KB |
testcase_05 | AC | 297 ms
217,428 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 35 ms
28,316 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 12 ms
10,500 KB |
testcase_11 | AC | 127 ms
91,928 KB |
testcase_12 | AC | 6 ms
6,400 KB |
testcase_13 | AC | 69 ms
49,700 KB |
testcase_14 | AC | 7 ms
6,764 KB |
testcase_15 | AC | 44 ms
32,964 KB |
testcase_16 | AC | 210 ms
151,696 KB |
testcase_17 | AC | 220 ms
162,156 KB |
testcase_18 | AC | 90 ms
66,068 KB |
testcase_19 | AC | 3 ms
4,380 KB |
testcase_20 | AC | 11 ms
9,040 KB |
testcase_21 | AC | 51 ms
37,024 KB |
testcase_22 | AC | 188 ms
136,820 KB |
testcase_23 | AC | 49 ms
35,992 KB |
testcase_24 | AC | 46 ms
34,204 KB |
testcase_25 | AC | 92 ms
65,592 KB |
testcase_26 | AC | 25 ms
18,636 KB |
ソースコード
#include <iostream> #include <iomanip> #include <string> #include <cmath> #include <algorithm> #include <vector> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <list> #include <stack> #include <queue> #include <bitset> #include <numeric> #include <cassert> #include <array> #include <memory> #include <random> #include <functional> #include <complex> #ifdef DEBUG #include "./Lib/debug.hpp" #include "./Lib/Timer.hpp" #include "./Lib/sample.hpp" #else #define dump(...) #endif /* (=^o^=) */ //#define int ll /* macro */ #define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i) #define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i) #define REP(i, n) FOR(i, 0, n) #define RREP(i, n) RFOR(i, 0, n) #define REPC(x,c) for(const auto& x:(c)) #define REPI2(it,b,e) for(auto it = (b); it != (e); ++it) #define REPI(it,c) REPI2(it, (c).begin(), (c).end()) #define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend()) #define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);) #define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end()) #define ALL(x) (x).begin(),(x).end() #define cauto const auto& /* macro func */ template<class T> inline void sort(T& t) { std::sort(ALL(t)); } template<class T> inline void rsort(T& t) { std::sort((t).rbegin(), (t).rend()); } template<class T> inline void unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); } template<class T, class S> inline bool chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; } template<class T, class S> inline bool chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; } template<class T, class S> inline bool chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; } inline void BR() { std::cout << "\n"; } /* type define */ using ll = long long; using PAIR = std::pair<ll, ll>; using VS = std::vector<std::string>; using VL = std::vector<long long>; using VVL = std::vector<VL>; using VVVL = std::vector<VVL>; using VD = std::vector<double>; template<class T> using V = std::vector<T>; /* using std */ using std::cout; constexpr char endl = '\n'; using std::cin; using std::pair; using std::string; using std::stack; using std::queue; using std::vector; using std::list; using std::map; using std::unordered_map; using std::multimap; using std::unordered_multimap; using std::set; using std::unordered_set; using std::unordered_multiset; using std::multiset; using std::bitset; using std::priority_queue; using std::tuple; /* constant value */ constexpr ll MOD = 1000000007; //constexpr ll MOD = 998244353; /* Initial processing */ struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing; /* Remove the source of the bug */ inline signed pow(signed, signed) { assert(false); return -1; } /* define hash */ namespace std { template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } }; } /* input */ template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; } //============================================================================================= signed main() { ll n, d, k; cin >> n >> d >> k; VVL dp(d * n + 1, VL(n + 1)); dp[0][0] = 1; FOR(i, 1, d * n + 1)FOR(j, 1, n + 1) { dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]; if (i - d - 1 >= 0) { dp[i][j] -= dp[i - d - 1][j - 1]; } if (dp[i][j] >= MOD) { dp[i][j] %= MOD; } if (dp[i][j] < 0) { dp[i][j] += MOD; } } cout << dp[k][n] << endl; //dump(dp); }