結果

問題 No.1532 Different Products
ユーザー haruki_Kharuki_K
提出日時 2021-06-04 21:12:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,037 bytes
コンパイル時間 2,477 ms
コンパイル使用メモリ 212,752 KB
実行使用メモリ 322,488 KB
最終ジャッジ日時 2024-11-19 11:48:49
合計ジャッジ時間 146,405 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 441 ms
54,588 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,816 KB
testcase_06 AC 2 ms
6,820 KB
testcase_07 AC 4 ms
6,820 KB
testcase_08 AC 8 ms
6,820 KB
testcase_09 AC 113 ms
30,628 KB
testcase_10 AC 494 ms
74,044 KB
testcase_11 AC 376 ms
60,468 KB
testcase_12 AC 1,519 ms
161,176 KB
testcase_13 AC 776 ms
116,364 KB
testcase_14 AC 3,694 ms
264,188 KB
testcase_15 AC 36 ms
33,440 KB
testcase_16 AC 642 ms
61,276 KB
testcase_17 AC 432 ms
70,812 KB
testcase_18 AC 281 ms
64,308 KB
testcase_19 AC 1,316 ms
155,292 KB
testcase_20 AC 3,544 ms
267,728 KB
testcase_21 AC 989 ms
87,508 KB
testcase_22 AC 756 ms
108,076 KB
testcase_23 AC 406 ms
83,508 KB
testcase_24 AC 3,191 ms
246,728 KB
testcase_25 AC 1,487 ms
138,404 KB
testcase_26 AC 110 ms
22,488 KB
testcase_27 AC 1,425 ms
117,676 KB
testcase_28 AC 993 ms
93,312 KB
testcase_29 AC 713 ms
71,960 KB
testcase_30 AC 2,006 ms
156,608 KB
testcase_31 AC 2,103 ms
160,012 KB
testcase_32 AC 2,513 ms
185,716 KB
testcase_33 AC 1,817 ms
143,492 KB
testcase_34 AC 3,148 ms
230,928 KB
testcase_35 AC 2,491 ms
184,836 KB
testcase_36 AC 3,100 ms
224,344 KB
testcase_37 AC 304 ms
37,888 KB
testcase_38 AC 3,305 ms
240,188 KB
testcase_39 AC 2,905 ms
213,576 KB
testcase_40 AC 2,965 ms
218,236 KB
testcase_41 TLE -
testcase_42 AC 3,810 ms
278,192 KB
testcase_43 TLE -
testcase_44 TLE -
testcase_45 TLE -
testcase_46 TLE -
testcase_47 TLE -
testcase_48 TLE -
testcase_49 TLE -
testcase_50 TLE -
testcase_51 TLE -
testcase_52 TLE -
testcase_53 TLE -
testcase_54 TLE -
testcase_55 TLE -
testcase_56 TLE -
testcase_57 TLE -
testcase_58 TLE -
testcase_59 TLE -
testcase_60 TLE -
testcase_61 AC 2 ms
6,820 KB
testcase_62 AC 2 ms
6,820 KB
testcase_63 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class T> vector<T> &operator--(vector<T> &v) { for (T &x : v) --x; return v; }
template <class T> vector<T> &operator++(vector<T> &v) { for (T &x : v) ++x; return v; }
// <<<
vector<int> quotients(int n) {
    assert(n > 0);
    static vector<int> ret;
    ret.clear();
    uint64_t m = n, x = 1;
    for ( ; x*x <= m; x++) ret.push_back(m/x);
    x--;
    if (m/x == x) x--;
    for ( ; x > 0; x--) ret.push_back(x);
    return ret;
}

int32_t main() {
    int N, K; cin >> N >> K;

    auto a = quotients(K);
    a.eb(0);
    reverse(all(a));

    auto dp = make_v<int, 2>(N+1, a.size(), -1);
    def (solve, int n, int k) -> int {
        int pos = lbd(a, k);
        int &res = dp[n][pos];
        if (res >= 0) return res;
        res = 0;
        if (k <= 0) {
            return res = 0;
        } else {
            res++;
            rep1 (x, n) res += solve(x-1, u64(k)/u32(x));
            return res;
        }
    };
    cout << solve(N, K)-1 << '\n';

}
0