結果
問題 | No.1532 Different Products |
ユーザー | torisasami4 |
提出日時 | 2021-06-04 21:38:50 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 897 ms / 4,000 ms |
コード長 | 5,197 bytes |
コンパイル時間 | 2,100 ms |
コンパイル使用メモリ | 185,512 KB |
実行使用メモリ | 26,140 KB |
最終ジャッジ日時 | 2023-08-12 12:11:28 |
合計ジャッジ時間 | 35,491 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 156 ms
10,288 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 3 ms
4,376 KB |
testcase_07 | AC | 4 ms
4,380 KB |
testcase_08 | AC | 10 ms
4,560 KB |
testcase_09 | AC | 104 ms
11,632 KB |
testcase_10 | AC | 222 ms
15,064 KB |
testcase_11 | AC | 174 ms
13,908 KB |
testcase_12 | AC | 514 ms
19,824 KB |
testcase_13 | AC | 364 ms
24,504 KB |
testcase_14 | AC | 856 ms
21,428 KB |
testcase_15 | AC | 148 ms
23,600 KB |
testcase_16 | AC | 158 ms
8,672 KB |
testcase_17 | AC | 227 ms
16,224 KB |
testcase_18 | AC | 225 ms
19,044 KB |
testcase_19 | AC | 508 ms
20,776 KB |
testcase_20 | AC | 745 ms
24,088 KB |
testcase_21 | AC | 248 ms
10,316 KB |
testcase_22 | AC | 360 ms
19,004 KB |
testcase_23 | AC | 270 ms
23,932 KB |
testcase_24 | AC | 839 ms
21,716 KB |
testcase_25 | AC | 413 ms
16,548 KB |
testcase_26 | AC | 70 ms
7,492 KB |
testcase_27 | AC | 356 ms
11,796 KB |
testcase_28 | AC | 299 ms
12,156 KB |
testcase_29 | AC | 194 ms
8,164 KB |
testcase_30 | AC | 444 ms
14,216 KB |
testcase_31 | AC | 470 ms
14,648 KB |
testcase_32 | AC | 571 ms
16,104 KB |
testcase_33 | AC | 400 ms
13,764 KB |
testcase_34 | AC | 720 ms
19,492 KB |
testcase_35 | AC | 537 ms
16,144 KB |
testcase_36 | AC | 684 ms
18,404 KB |
testcase_37 | AC | 93 ms
5,712 KB |
testcase_38 | AC | 751 ms
20,020 KB |
testcase_39 | AC | 648 ms
18,436 KB |
testcase_40 | AC | 660 ms
18,980 KB |
testcase_41 | AC | 884 ms
25,892 KB |
testcase_42 | AC | 766 ms
23,584 KB |
testcase_43 | AC | 842 ms
24,544 KB |
testcase_44 | AC | 896 ms
25,916 KB |
testcase_45 | AC | 897 ms
25,728 KB |
testcase_46 | AC | 860 ms
25,136 KB |
testcase_47 | AC | 895 ms
25,852 KB |
testcase_48 | AC | 875 ms
25,780 KB |
testcase_49 | AC | 879 ms
25,772 KB |
testcase_50 | AC | 876 ms
25,920 KB |
testcase_51 | AC | 892 ms
25,808 KB |
testcase_52 | AC | 875 ms
25,652 KB |
testcase_53 | AC | 890 ms
25,940 KB |
testcase_54 | AC | 870 ms
25,688 KB |
testcase_55 | AC | 889 ms
25,764 KB |
testcase_56 | AC | 845 ms
25,172 KB |
testcase_57 | AC | 856 ms
25,528 KB |
testcase_58 | AC | 877 ms
25,652 KB |
testcase_59 | AC | 813 ms
24,508 KB |
testcase_60 | AC | 888 ms
26,140 KB |
testcase_61 | AC | 2 ms
4,376 KB |
testcase_62 | AC | 1 ms
4,380 KB |
testcase_63 | AC | 873 ms
25,884 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb(x) push_back(x) #define mp(a, b) make_pair(a, b) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define lscan(x) scanf("%I64d", &x) #define lprint(x) printf("%I64d", x) #define rep(i, n) for (ll i = 0; i < (n); i++) #define rep2(i, n) for (ll i = (ll)n - 1; i >= 0; i--) #define REP(i, l, r) for (ll i = l; i < (r); i++) #define REP2(i, l, r) for (ll i = (ll)r - 1; i >= (l); i--) #define siz(x) (ll)x.size() template <class T> using rque = priority_queue<T, vector<T>, greater<T>>; const ll mod = (int)1e9 + 7; template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } template <class T> bool chmax(T &a, const T &b) { if (b > a) { a = b; return 1; } return 0; } ll gcd(ll a, ll b) { if(a == 0) return b; if(b == 0) return a; ll c = a % b; while (c != 0) { a = b; b = c; c = a % b; } return b; } long long extGCD(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long d = extGCD(b, a % b, y, x); y -= a / b * x; return d; } struct UnionFind { vector<ll> data; int num; UnionFind(int sz) { data.assign(sz, -1); num = sz; } bool unite(int x, int y) { x = find(x), y = find(y); if (x == y) return (false); if (data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; num--; return (true); } int find(int k) { if (data[k] < 0) return (k); return (data[k] = find(data[k])); } ll size(int k) { return (-data[find(k)]); } }; ll M = 1000000007; template <int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt<mod>(t); return (is); } static int get_mod() { return mod; } }; using mint = ModInt<mod>; mint mpow(ll x, ll n) { mint ans = 1; while (n != 0) { if (n & 1) ans *= x; x = x * x % mod; n = n >> 1; } return ans; } ll mpow2(ll x, ll n, ll mod) { ll ans = 1; while (n != 0) { if (n & 1) ans = ans * x % mod; x = x * x % mod; n = n >> 1; } return ans; } vector<mint> fac; vector<mint> ifac; void setcomb(int sz = 2000010) { fac.assign(sz + 1, 0); ifac.assign(sz + 1, 0); fac[0] = 1; for (ll i = 0; i < sz; i++) { fac[i + 1] = fac[i] * (i + 1); // n!(mod M) } ifac[sz] = fac[sz].inverse(); for (ll i = sz; i > 0; i--) { ifac[i - 1] = ifac[i] * i; } } mint comb(ll a, ll b) { if(fac.size() == 0) setcomb(); if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; return ifac[a - b] * ifac[b] * fac[a]; } mint perm(ll a, ll b) { if(fac.size() == 0) setcomb(); if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; return fac[a] * ifac[a - b]; } long long modinv(long long a) { long long b = M, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= M; if (u < 0) u += M; return u; } ll modinv2(ll a, ll mod) { ll b = mod, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return u; } int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); ll n, k; cin >> n >> k; set<ll> li; ll ma = 1e12; for (ll i = 1; i * i <= k; i++){ if(k/(i+1) < k/i){ li.insert(i); ma = i; } } for (ll i = 1;; i++){ if(k/i <= ma) break; li.insert(k / i); } vector<ll> v; v.pb(0); for (auto &e : li) v.pb(e); ll num = v.size(); unordered_map<ll, ll> mp; rep(i, num) mp[v[i]] = i; ll dp[num], ndp[num]; rep(i, num) dp[i] = 1; dp[0] = 0; rep(i,n){ rep(j, num) ndp[j] = dp[j] + dp[mp[v[j] / (i + 1)]]; rep(j, num) dp[j] = ndp[j]; } cout << dp[num - 1] - 1 << endl; }