結果

問題 No.1532 Different Products
ユーザー rniyarniya
提出日時 2021-06-04 21:12:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,209 ms / 4,000 ms
コード長 6,079 bytes
コンパイル時間 3,618 ms
コンパイル使用メモリ 230,208 KB
実行使用メモリ 164,792 KB
最終ジャッジ日時 2024-04-27 05:05:44
合計ジャッジ時間 41,474 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 166 ms
76,048 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 37 ms
24,492 KB
testcase_10 AC 230 ms
100,804 KB
testcase_11 AC 215 ms
98,384 KB
testcase_12 AC 433 ms
143,092 KB
testcase_13 AC 376 ms
156,124 KB
testcase_14 AC 841 ms
149,440 KB
testcase_15 AC 3 ms
6,944 KB
testcase_16 AC 186 ms
52,368 KB
testcase_17 AC 248 ms
109,352 KB
testcase_18 AC 97 ms
51,560 KB
testcase_19 AC 392 ms
147,020 KB
testcase_20 AC 807 ms
153,700 KB
testcase_21 AC 285 ms
78,824 KB
testcase_22 AC 296 ms
121,472 KB
testcase_23 AC 162 ms
81,904 KB
testcase_24 AC 706 ms
151,968 KB
testcase_25 AC 308 ms
113,340 KB
testcase_26 AC 64 ms
29,312 KB
testcase_27 AC 414 ms
87,556 KB
testcase_28 AC 240 ms
89,952 KB
testcase_29 AC 489 ms
52,356 KB
testcase_30 AC 623 ms
96,100 KB
testcase_31 AC 573 ms
100,764 KB
testcase_32 AC 632 ms
107,760 KB
testcase_33 AC 512 ms
97,280 KB
testcase_34 AC 783 ms
142,544 KB
testcase_35 AC 589 ms
109,800 KB
testcase_36 AC 759 ms
118,572 KB
testcase_37 AC 109 ms
29,616 KB
testcase_38 AC 740 ms
144,892 KB
testcase_39 AC 627 ms
121,328 KB
testcase_40 AC 628 ms
119,820 KB
testcase_41 AC 1,119 ms
162,476 KB
testcase_42 AC 870 ms
153,448 KB
testcase_43 AC 944 ms
157,280 KB
testcase_44 AC 1,148 ms
160,232 KB
testcase_45 AC 1,147 ms
161,248 KB
testcase_46 AC 1,070 ms
162,600 KB
testcase_47 AC 1,163 ms
162,224 KB
testcase_48 AC 1,183 ms
161,304 KB
testcase_49 AC 1,174 ms
164,012 KB
testcase_50 AC 1,138 ms
160,428 KB
testcase_51 AC 1,172 ms
163,776 KB
testcase_52 AC 1,139 ms
159,996 KB
testcase_53 AC 1,180 ms
164,792 KB
testcase_54 AC 1,138 ms
159,220 KB
testcase_55 AC 1,209 ms
160,452 KB
testcase_56 AC 1,075 ms
159,200 KB
testcase_57 AC 1,109 ms
159,444 KB
testcase_58 AC 1,142 ms
160,316 KB
testcase_59 AC 1,003 ms
157,464 KB
testcase_60 AC 1,185 ms
163,944 KB
testcase_61 AC 2 ms
6,940 KB
testcase_62 AC 2 ms
6,940 KB
testcase_63 AC 1,162 ms
160,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX = 70;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    ll K;
    cin >> N >> K;
    vector<pair<ll, ll>> mp, nxt;
    mp.emplace_back(1, 1);
    int cur = 1;
    for (; cur <= N && cur <= MAX; cur++) {
        int i = 0;
        for (auto& p : mp) {
            while (i < mp.size() && mp[i].first <= p.first * cur) nxt.emplace_back(mp[i++]);
            ll prod = p.first * cur;
            if (prod > K) break;
            if (nxt.back().first == prod)
                nxt.back().second += p.second;
            else
                nxt.emplace_back(prod, p.second);
        }
        while (i < mp.size()) nxt.emplace_back(mp[i++]);
        swap(mp, nxt);
        nxt.clear();
    }

    vector<ll> a, sum;
    sum.emplace_back(0);
    for (auto& p : mp) {
        a.emplace_back(p.first);
        sum.emplace_back(p.second);
    }
    for (int i = 1; i < sum.size(); i++) sum[i] += sum[i - 1];
    auto calc = [&](ll x) {
        ll ok = K / x;
        int cnt = upper_bound(ALL(a), ok) - a.begin();
        return sum[cnt];
    };

    ll ans = sum.back() - 1;
    for (int i = cur; i <= N; i++) {
        int prod1 = i;
        if (prod1 > K) break;
        ans += calc(prod1);
        for (int j = i + 1; j <= N; j++) {
            int prod2 = prod1 * j;
            if (prod2 > K) break;
            ans += calc(prod2);
            for (int k = j + 1; k <= N; k++) {
                int prod3 = prod2 * k;
                if (prod3 > K) break;
                ans += calc(prod3);
                for (int l = k + 1; l <= N; l++) {
                    int prod4 = prod3 * l;
                    if (prod4 > K) break;
                    ans += calc(prod4);
                    for (int m = l + 1; m <= N; m++) {
                        ll prod5 = ll(prod4) * m;
                        if (prod5 > K) break;
                        ans += calc(prod5);
                    }
                }
            }
        }
    }

    cout << ans << '\n';
    return 0;
}
0