結果

問題 No.1383 Numbers of Product
ユーザー rniyarniya
提出日時 2021-02-07 21:24:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 903 ms / 2,000 ms
コード長 5,625 bytes
コンパイル時間 3,543 ms
コンパイル使用メモリ 205,972 KB
実行使用メモリ 46,864 KB
最終ジャッジ日時 2023-08-14 22:12:28
合計ジャッジ時間 25,562 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 1 ms
4,384 KB
testcase_07 AC 491 ms
28,364 KB
testcase_08 AC 472 ms
28,116 KB
testcase_09 AC 669 ms
42,028 KB
testcase_10 AC 858 ms
46,604 KB
testcase_11 AC 839 ms
45,944 KB
testcase_12 AC 868 ms
46,200 KB
testcase_13 AC 835 ms
44,872 KB
testcase_14 AC 722 ms
42,176 KB
testcase_15 AC 540 ms
29,696 KB
testcase_16 AC 844 ms
46,128 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 1 ms
4,380 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 1 ms
4,380 KB
testcase_26 AC 2 ms
4,380 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 9 ms
4,376 KB
testcase_29 AC 690 ms
42,080 KB
testcase_30 AC 876 ms
46,792 KB
testcase_31 AC 1 ms
4,376 KB
testcase_32 AC 144 ms
12,396 KB
testcase_33 AC 2 ms
4,380 KB
testcase_34 AC 2 ms
4,380 KB
testcase_35 AC 802 ms
44,004 KB
testcase_36 AC 764 ms
42,640 KB
testcase_37 AC 901 ms
46,796 KB
testcase_38 AC 903 ms
46,852 KB
testcase_39 AC 901 ms
46,708 KB
testcase_40 AC 871 ms
46,860 KB
testcase_41 AC 871 ms
46,740 KB
testcase_42 AC 871 ms
46,784 KB
testcase_43 AC 874 ms
46,800 KB
testcase_44 AC 860 ms
46,712 KB
testcase_45 AC 880 ms
46,864 KB
testcase_46 AC 1 ms
4,380 KB
testcase_47 AC 847 ms
46,132 KB
testcase_48 AC 857 ms
46,324 KB
testcase_49 AC 882 ms
46,768 KB
testcase_50 AC 867 ms
46,472 KB
testcase_51 AC 1 ms
4,380 KB
testcase_52 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N, K, M;
    cin >> N >> K >> M;

    // Bは高々20とかまで
    // 先にB>=3での表し方がM-1かMになるものをチェックして、それがB=2で表せるかチェック
    // M=1のときはM>=2として表せるものを計算して除く

    unordered_map<ll, int> mp;
    for (int B = 3; B <= 20; B++) {
        for (int A = 1;; A++) {
            ll prod = 1;
            bool ok = true;
            for (int i = 0; i < B; i++) {
                ll nxt = K * i + A;
                if (2 * N / prod <= nxt) {
                    ok = false;
                    break;
                }
                prod *= nxt;
            }
            if (!ok) break;
            if (prod > N) break;
            mp[prod]++;
        }
    }

    auto check = [&](ll x) {
        int lb = 0, ub = INF + 10;
        while (ub - lb > 1) {
            int mid = (lb + ub) >> 1;
            (2 * N / (K + mid) <= mid || (K + mid) * mid >= x ? ub : lb) = mid;
        }
        return 2 * N / (K + ub) > ub && (K + ub) * ub == x;
    };

    int ans = 0, sum = 0;
    for (auto p : mp) {
        bool ok = check(p.first);
        sum += ok;
        if (p.second != M - 1 && p.second != M) continue;
        int cur = p.second;
        cur += check(p.first);
        ans += (cur == M);
    }

    if (M == 1) {
        int lb = 0, ub = INF + 10;
        while (ub - lb > 1) {
            int mid = (ub + lb) >> 1;
            (2 * N / (K + mid) <= mid || (K + mid) * mid > N ? ub : lb) = mid;
        }
        ans += lb - sum;
    }

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