結果

問題 No.1532 Different Products
ユーザー satashunsatashun
提出日時 2022-07-04 22:16:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,398 bytes
コンパイル時間 1,973 ms
コンパイル使用メモリ 207,768 KB
実行使用メモリ 475,760 KB
最終ジャッジ日時 2024-05-08 12:14:14
合計ジャッジ時間 25,815 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 112 ms
78,392 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 7 ms
6,528 KB
testcase_09 AC 59 ms
42,212 KB
testcase_10 AC 144 ms
106,304 KB
testcase_11 AC 113 ms
86,544 KB
testcase_12 AC 303 ms
235,728 KB
testcase_13 AC 215 ms
167,152 KB
testcase_14 AC 523 ms
389,920 KB
testcase_15 AC 53 ms
43,120 KB
testcase_16 AC 116 ms
88,960 KB
testcase_17 AC 127 ms
100,924 KB
testcase_18 AC 118 ms
90,372 KB
testcase_19 AC 294 ms
226,412 KB
testcase_20 AC 528 ms
394,492 KB
testcase_21 AC 168 ms
127,968 KB
testcase_22 AC 201 ms
155,944 KB
testcase_23 AC 153 ms
118,372 KB
testcase_24 AC 483 ms
363,792 KB
testcase_25 AC 261 ms
202,364 KB
testcase_26 AC 40 ms
30,976 KB
testcase_27 AC 231 ms
172,432 KB
testcase_28 AC 182 ms
135,896 KB
testcase_29 AC 141 ms
105,208 KB
testcase_30 AC 307 ms
230,284 KB
testcase_31 AC 325 ms
235,796 KB
testcase_32 AC 370 ms
274,392 KB
testcase_33 AC 284 ms
211,192 KB
testcase_34 AC 462 ms
340,244 KB
testcase_35 AC 365 ms
272,788 KB
testcase_36 AC 449 ms
331,008 KB
testcase_37 AC 71 ms
54,528 KB
testcase_38 AC 485 ms
354,152 KB
testcase_39 AC 428 ms
315,132 KB
testcase_40 AC 435 ms
321,508 KB
testcase_41 AC 648 ms
461,196 KB
testcase_42 AC 553 ms
408,356 KB
testcase_43 AC 725 ms
427,360 KB
testcase_44 AC 643 ms
466,916 KB
testcase_45 AC 648 ms
468,616 KB
testcase_46 AC 630 ms
454,448 KB
testcase_47 AC 674 ms
473,676 KB
testcase_48 AC 663 ms
468,344 KB
testcase_49 AC 661 ms
470,696 KB
testcase_50 AC 654 ms
466,912 KB
testcase_51 AC 652 ms
471,980 KB
testcase_52 AC 645 ms
463,424 KB
testcase_53 AC 668 ms
473,812 KB
testcase_54 AC 642 ms
463,420 KB
testcase_55 AC 648 ms
469,420 KB
testcase_56 AC 629 ms
454,012 KB
testcase_57 AC 673 ms
457,172 KB
testcase_58 AC 631 ms
466,016 KB
testcase_59 AC 601 ms
439,444 KB
testcase_60 WA -
testcase_61 WA -
testcase_62 AC 2 ms
5,376 KB
testcase_63 AC 642 ms
469,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region satashun
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
void scan(vector<T>& v, T offset = T(0)) {
    for (auto& x : v) {
        cin >> x;
        x += offset;
    }
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

void slv() {
    int N;
    ll K;
    cin >> N >> K;

    ll sq = 1;
    while (sq * sq < K) sq++;

    auto dp1 = make_vec<ll>(N + 1, sq);
    auto ps1 = make_vec<ll>(N + 1, sq);
    auto dp2 = make_vec<ll>(N + 1, sq);
    dp1[0][1] = 1;
    rep(i, sq - 1) ps1[0][i + 1] = 1;
    rep(i, sq - 1) dp2[0][i + 1] = 1;

    for (int i = 1; i <= N; ++i) {
        rep(j, sq) {
            dp1[i][j] = dp1[i - 1][j];
            dp2[i][j] = dp2[i - 1][j];
        }
        for (int j = 1; j * i < sq; ++j) {
            dp1[i][j * i] += dp1[i - 1][j];
        }
        rep(j, sq - 1) ps1[i][j + 1] = ps1[i][j] + dp1[i][j + 1];
        rep(j, sq) {
            dp2[i][j] +=
                (j * i < sq ? dp2[i - 1][j * i] : ps1[i - 1][K / (i * j)]);
        }
    }
    show(dp2[N][1] - 1);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}
0