結果
問題 | No.1011 Infinite Stairs |
ユーザー | tsutaj |
提出日時 | 2020-03-20 21:41:09 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 225 ms / 2,000 ms |
コード長 | 3,196 bytes |
コンパイル時間 | 979 ms |
コンパイル使用メモリ | 101,952 KB |
実行使用メモリ | 236,348 KB |
最終ジャッジ日時 | 2023-09-24 10:55:03 |
合計ジャッジ時間 | 5,023 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 95 ms
236,124 KB |
testcase_01 | AC | 95 ms
236,112 KB |
testcase_02 | AC | 99 ms
236,068 KB |
testcase_03 | AC | 179 ms
236,068 KB |
testcase_04 | AC | 225 ms
236,076 KB |
testcase_05 | AC | 217 ms
236,076 KB |
testcase_06 | AC | 62 ms
236,116 KB |
testcase_07 | AC | 77 ms
236,124 KB |
testcase_08 | AC | 62 ms
236,272 KB |
testcase_09 | AC | 62 ms
236,068 KB |
testcase_10 | AC | 66 ms
236,064 KB |
testcase_11 | AC | 114 ms
236,072 KB |
testcase_12 | AC | 64 ms
236,072 KB |
testcase_13 | AC | 90 ms
236,112 KB |
testcase_14 | AC | 65 ms
236,068 KB |
testcase_15 | AC | 81 ms
236,108 KB |
testcase_16 | AC | 152 ms
236,280 KB |
testcase_17 | AC | 157 ms
236,124 KB |
testcase_18 | AC | 100 ms
236,108 KB |
testcase_19 | AC | 62 ms
236,060 KB |
testcase_20 | AC | 65 ms
236,176 KB |
testcase_21 | AC | 83 ms
236,072 KB |
testcase_22 | AC | 142 ms
236,160 KB |
testcase_23 | AC | 81 ms
236,112 KB |
testcase_24 | AC | 80 ms
236,188 KB |
testcase_25 | AC | 100 ms
236,068 KB |
testcase_26 | AC | 72 ms
236,348 KB |
ソースコード
// #define _GLIBCXX_DEBUG // for STL debug (optional) #include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> #include <numeric> #include <fstream> #include <functional> #include <bitset> using namespace std; using ll = long long int; using int64 = long long int; template<typename T> void chmax(T &a, T b) {a = max(a, b);} template<typename T> void chmin(T &a, T b) {a = min(a, b);} template<typename T> void chadd(T &a, T b) {a = a + b;} int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const int INF = 1LL << 29; const ll LONGINF = 1LL << 60; const ll MOD = 1000000007LL; // ModInt begin using ll = long long; template<ll mod> struct ModInt { ll v; ll mod_pow(ll x, ll n) const { return (!n) ? 1 : (mod_pow((x*x)%mod,n/2) * ((n&1)?x:1)) % mod; } ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {} ModInt operator+ ( const ModInt& b ) const { return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v)); } ModInt operator- () const { return ModInt(-v); } ModInt operator- ( const ModInt& b ) const { return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v)); } ModInt operator* ( const ModInt& b ) const {return (v * b.v) % mod;} ModInt operator/ ( const ModInt& b ) const {return (v * mod_pow(b.v, mod-2)) % mod;} bool operator== ( const ModInt &b ) const {return v == b.v;} bool operator!= ( const ModInt &b ) const {return !(*this == b); } ModInt& operator+= ( const ModInt &b ) { v += b.v; if(v >= mod) v -= mod; return *this; } ModInt& operator-= ( const ModInt &b ) { v -= b.v; if(v < 0) v += mod; return *this; } ModInt& operator*= ( const ModInt &b ) { (v *= b.v) %= mod; return *this; } ModInt& operator/= ( const ModInt &b ) { (v *= mod_pow(b.v, mod-2)) %= mod; return *this; } ModInt pow(ll x) { return ModInt(mod_pow(v, x)); } // operator int() const { return int(v); } // operator long long int() const { return v; } }; template<ll mod> ModInt<mod> pow(ModInt<mod> n, ll k) { return ModInt<mod>(n.mod_pow(n.v, k)); } template<ll mod> ostream& operator<< (ostream& out, ModInt<mod> a) {return out << a.v;} template<ll mod> istream& operator>> (istream& in, ModInt<mod>& a) { in >> a.v; return in; } // ModInt end using mint = ModInt<MOD>; mint dp[310][310 * 310]; int main() { int N, D, K; cin >> N >> D >> K; for(int i=0; i<=D*N; i++) { dp[0][i] = mint(1); } for(int i=0; i<N; i++) { for(int j=1; j<=D*N; j++) { dp[i+1][j] += dp[i+1][j-1]; int l = j-D, r = j-1; dp[i+1][j] += dp[i][r]; if(l >= 1) dp[i+1][j] -= dp[i][l-1]; } } cout << dp[N][K] - dp[N][K-1] << endl; return 0; }