結果
問題 | No.269 見栄っ張りの募金活動 |
ユーザー | penguinshunya |
提出日時 | 2019-07-22 13:12:52 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,567 bytes |
コンパイル時間 | 1,683 ms |
コンパイル使用メモリ | 167,140 KB |
実行使用メモリ | 12,116 KB |
最終ジャッジ日時 | 2024-06-23 18:35:16 |
合計ジャッジ時間 | 20,577 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
12,072 KB |
testcase_01 | AC | 5 ms
11,968 KB |
testcase_02 | AC | 5 ms
11,952 KB |
testcase_03 | AC | 23 ms
12,116 KB |
testcase_04 | AC | 3,871 ms
11,892 KB |
testcase_05 | AC | 6 ms
11,908 KB |
testcase_06 | AC | 5 ms
12,072 KB |
testcase_07 | TLE | - |
testcase_08 | AC | 5 ms
11,984 KB |
testcase_09 | AC | 22 ms
11,920 KB |
testcase_10 | AC | 5 ms
11,904 KB |
testcase_11 | AC | 1,796 ms
12,052 KB |
testcase_12 | AC | 10 ms
11,916 KB |
testcase_13 | AC | 817 ms
11,980 KB |
testcase_14 | AC | 530 ms
12,076 KB |
testcase_15 | AC | 1,124 ms
12,052 KB |
testcase_16 | AC | 27 ms
11,896 KB |
testcase_17 | AC | 5 ms
12,092 KB |
testcase_18 | AC | 1,366 ms
12,004 KB |
testcase_19 | AC | 420 ms
11,956 KB |
testcase_20 | AC | 244 ms
12,004 KB |
testcase_21 | AC | 827 ms
12,032 KB |
testcase_22 | AC | 269 ms
12,008 KB |
testcase_23 | AC | 12 ms
11,948 KB |
testcase_24 | AC | 672 ms
12,036 KB |
ソースコード
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define each(x, y) for (auto &x : y) #define all(a) (a).begin(), (a).end() #define bit(b) (1ll << (b)) using namespace std; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f80 = long double; using vi32 = vector<i32>; using vi64 = vector<i64>; using vu64 = vector<u64>; using vf80 = vector<f80>; using vstr = vector<string>; inline void yes() { cout << "Yes" << '\n'; exit(0); } inline void no() { cout << "No" << '\n'; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; } inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {}; template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {}; template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; } template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; } template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; } template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; } template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; } template <int mod> struct ModInt { int x; ModInt(): x(0) {} ModInt(long long a) { x = a % mod; if (x < 0) x += mod; } ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; } ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; } ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt inverse() { int a = x, b = mod, u = 1, v = 0; while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); } return ModInt(u); } #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; } op(+, +=) op(-, -=) op(*, *=) op(/, /=) #undef op friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; } }; using mint = ModInt<1000000007>; int N, S, K; mint me[110][20010]; mint dfs(int i, int x) { if (me[i][x].x != -1) { return me[i][x]; } if (i == N) { return me[i][x] = (x == 0); } mint co = 0; repc(j, S) { int y = j + (j + K) * (N - i - 1); if (x < y) break; co += dfs(i + 1, x - y); } return me[i][x] = co; } void solve() { cin >> N >> S >> K; rep(i, 110) rep(j, 20010) me[i][j].x = -1; cout << dfs(0, S) << '\n'; }