結果
問題 | No.269 見栄っ張りの募金活動 |
ユーザー | penguinshunya |
提出日時 | 2019-07-22 11:11:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,724 bytes |
コンパイル時間 | 2,627 ms |
コンパイル使用メモリ | 219,448 KB |
実行使用メモリ | 18,208 KB |
最終ジャッジ日時 | 2024-06-23 18:34:03 |
合計ジャッジ時間 | 8,954 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | TLE | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
ソースコード
#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 opfriend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }};using mint = ModInt<1000000007>;unordered_map<int, unordered_map<int, unordered_map<int, mint>>> me;function<mint(int, int, int)> dfs;void solve() {int n, s, k; cin >> n >> s >> k;dfs = [&](int i, int l, int x) {if (i == n) {if (x == s) return (mint) 1;return (mint) 0;}if (me[i][l].count(x)) {return me[i][l][x];}{int c = n - i;if (s - x < l * c + k * c * (c - 1) / 2) return (mint) 0;}mint co = 0;repic(j, l, s - k) {co += dfs(i + 1, j + k, x + j);}return me[i][l][x] = co;};cout << dfs(0, 0, 0) << '\n';}