結果
問題 | No.1532 Different Products |
ユーザー | opt |
提出日時 | 2021-06-04 22:55:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 867 ms / 4,000 ms |
コード長 | 5,211 bytes |
コンパイル時間 | 4,564 ms |
コンパイル使用メモリ | 271,036 KB |
実行使用メモリ | 215,272 KB |
最終ジャッジ日時 | 2023-08-12 16:25:57 |
合計ジャッジ時間 | 35,378 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge9 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
7,792 KB |
testcase_01 | AC | 129 ms
88,016 KB |
testcase_02 | AC | 18 ms
18,676 KB |
testcase_03 | AC | 8 ms
9,440 KB |
testcase_04 | AC | 12 ms
13,468 KB |
testcase_05 | AC | 5 ms
7,024 KB |
testcase_06 | AC | 13 ms
14,176 KB |
testcase_07 | AC | 18 ms
18,712 KB |
testcase_08 | AC | 20 ms
20,300 KB |
testcase_09 | AC | 46 ms
37,468 KB |
testcase_10 | AC | 116 ms
74,556 KB |
testcase_11 | AC | 96 ms
65,144 KB |
testcase_12 | AC | 291 ms
123,820 KB |
testcase_13 | AC | 165 ms
73,840 KB |
testcase_14 | AC | 717 ms
205,496 KB |
testcase_15 | AC | 20 ms
18,728 KB |
testcase_16 | AC | 159 ms
124,728 KB |
testcase_17 | AC | 97 ms
62,908 KB |
testcase_18 | AC | 79 ms
47,416 KB |
testcase_19 | AC | 271 ms
112,608 KB |
testcase_20 | AC | 662 ms
191,064 KB |
testcase_21 | AC | 222 ms
140,464 KB |
testcase_22 | AC | 154 ms
83,040 KB |
testcase_23 | AC | 94 ms
52,744 KB |
testcase_24 | AC | 582 ms
181,888 KB |
testcase_25 | AC | 303 ms
131,920 KB |
testcase_26 | AC | 59 ms
49,748 KB |
testcase_27 | AC | 315 ms
163,544 KB |
testcase_28 | AC | 238 ms
122,004 KB |
testcase_29 | AC | 195 ms
160,284 KB |
testcase_30 | AC | 460 ms
188,864 KB |
testcase_31 | AC | 462 ms
186,672 KB |
testcase_32 | AC | 591 ms
197,736 KB |
testcase_33 | AC | 411 ms
177,520 KB |
testcase_34 | AC | 616 ms
192,628 KB |
testcase_35 | AC | 606 ms
194,988 KB |
testcase_36 | AC | 697 ms
204,656 KB |
testcase_37 | AC | 178 ms
157,256 KB |
testcase_38 | AC | 630 ms
198,292 KB |
testcase_39 | AC | 607 ms
193,572 KB |
testcase_40 | AC | 593 ms
193,036 KB |
testcase_41 | AC | 783 ms
209,168 KB |
testcase_42 | AC | 739 ms
203,624 KB |
testcase_43 | AC | 738 ms
204,100 KB |
testcase_44 | AC | 814 ms
214,472 KB |
testcase_45 | AC | 812 ms
214,468 KB |
testcase_46 | AC | 815 ms
213,332 KB |
testcase_47 | AC | 837 ms
215,132 KB |
testcase_48 | AC | 833 ms
214,352 KB |
testcase_49 | AC | 822 ms
215,012 KB |
testcase_50 | AC | 803 ms
214,460 KB |
testcase_51 | AC | 829 ms
214,944 KB |
testcase_52 | AC | 825 ms
214,080 KB |
testcase_53 | AC | 853 ms
214,932 KB |
testcase_54 | AC | 853 ms
214,140 KB |
testcase_55 | AC | 867 ms
214,688 KB |
testcase_56 | AC | 862 ms
213,292 KB |
testcase_57 | AC | 849 ms
213,608 KB |
testcase_58 | AC | 832 ms
214,208 KB |
testcase_59 | AC | 820 ms
212,096 KB |
testcase_60 | AC | 850 ms
215,272 KB |
testcase_61 | AC | 4 ms
6,276 KB |
testcase_62 | AC | 4 ms
6,268 KB |
testcase_63 | AC | 829 ms
214,740 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #include<atcoder/all> using namespace atcoder; // input and output of modint istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } template<int m> istream &operator>>(istream &is, static_modint<m> &a) { long long v; is >> v; a = v; return is; } template<int m> ostream &operator<<(ostream &os, const static_modint<m> &a) { return os << a.val(); } template<int m> istream &operator>>(istream &is, dynamic_modint<m> &a) { long long v; is >> v; a = v; return is; } template<int m> ostream &operator<<(ostream &os, const dynamic_modint<m> &a) { return os << a.val(); } #define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i) #define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i) #define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #ifdef LOCAL void debug_out() { cerr << endl; } template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); } #define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template<class T> using V = vector<T>; template<class T> using VV = V<V<T>>; using ll = long long; using ld = long double; using Vi = V<int>; using VVi = VV<int>; using Vl = V<ll>; using VVl = VV<ll>; using Vd = V<ld>; using VVd = VV<ld>; using Vb = V<bool>; using VVb = VV<bool>; template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>; template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<class T> inline int sz(const T &x) { return x.size(); } template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; } template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; } template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template<class T, size_t n> istream &operator>>(istream &is, array<T, n> &v) { for (auto &e : v) is >> e; return is; } template<class T, size_t n> ostream &operator<<(ostream &os, const array<T, n> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; } template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> istream &operator>>(istream &is, deque<T> &v) { for (auto &e : v) is >> e; return is; } template<class T> ostream &operator<<(ostream &os, const deque<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); } template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r) inline ll ceil_div(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y) inline int floor_log2(const ll x) { assert(x > 0); return 63 - __builtin_clzll(x); } // floor(log2(x)) inline int ceil_log2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64 - __builtin_clzll(x-1); } // ceil(log2(x)) inline int popcount(const ll x) { return __builtin_popcountll(x); } inline void fail() { cout << -1 << '\n'; exit(0); } struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; // constexpr int INF = numeric_limits<int>::max() >> 1; // constexpr ll INFll = numeric_limits<ll>::max() >> 1; // constexpr ld EPS = 1e-10; // const ld PI = acos(-1.0); // using mint = modint998244353; // using mint = modint1000000007; // using mint = modint; // using Vm = V<mint>; using VVm = V<Vm>; constexpr int m = 1e5; unordered_map<ll, ll> memo[202]; VVl pre; ll dp(int n, ll k) { if (k == 0) return 0; if (n == 0) return 1; if (k <= m) return pre[n][k]; if (memo[n].count(k)) return memo[n][k]; return memo[n][k] = dp(n-1, k) + dp(n-1, k/n); } int main() { ll n, k; cin >> n >> k; pre.assign(n+1, Vl(m+1, 0)); pre[0][1] = 1; rep(i, n) rep(j, m+1) { pre[i+1][j] += pre[i][j]; int k = j * (i+1); if (k <= m) pre[i+1][k] += pre[i][j]; } rep(i, 1, n+1) rep(j, m) pre[i][j+1] += pre[i][j]; cout << (dp(n, k) - 1) << '\n'; }