結果

問題 No.1383 Numbers of Product
ユーザー yuto1115yuto1115
提出日時 2021-02-07 21:37:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 814 ms / 2,000 ms
コード長 4,420 bytes
コンパイル時間 2,181 ms
コンパイル使用メモリ 209,396 KB
実行使用メモリ 68,352 KB
最終ジャッジ日時 2024-05-02 10:18:35
合計ジャッジ時間 20,931 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
5,248 KB
testcase_01 AC 30 ms
5,376 KB
testcase_02 AC 31 ms
5,376 KB
testcase_03 AC 31 ms
5,376 KB
testcase_04 AC 29 ms
5,376 KB
testcase_05 AC 30 ms
5,376 KB
testcase_06 AC 29 ms
5,376 KB
testcase_07 AC 458 ms
43,136 KB
testcase_08 AC 456 ms
42,496 KB
testcase_09 AC 303 ms
51,968 KB
testcase_10 AC 730 ms
67,584 KB
testcase_11 AC 740 ms
66,688 KB
testcase_12 AC 731 ms
67,456 KB
testcase_13 AC 696 ms
64,768 KB
testcase_14 AC 586 ms
55,296 KB
testcase_15 AC 472 ms
45,440 KB
testcase_16 AC 814 ms
66,944 KB
testcase_17 AC 1 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 1 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 5 ms
5,376 KB
testcase_29 AC 589 ms
53,376 KB
testcase_30 AC 778 ms
68,352 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 93 ms
16,640 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 368 ms
62,464 KB
testcase_36 AC 655 ms
59,904 KB
testcase_37 AC 750 ms
68,224 KB
testcase_38 AC 739 ms
68,352 KB
testcase_39 AC 403 ms
68,224 KB
testcase_40 AC 407 ms
68,224 KB
testcase_41 AC 751 ms
68,224 KB
testcase_42 AC 742 ms
68,224 KB
testcase_43 AC 734 ms
68,352 KB
testcase_44 AC 407 ms
68,224 KB
testcase_45 AC 730 ms
68,224 KB
testcase_46 AC 2 ms
5,376 KB
testcase_47 AC 702 ms
66,816 KB
testcase_48 AC 751 ms
67,200 KB
testcase_49 AC 733 ms
67,968 KB
testcase_50 AC 738 ms
67,840 KB
testcase_51 AC 2 ms
5,376 KB
testcase_52 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popcount(x) __builtin_popcount(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using LP = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<P>;
using vvp = vector<vector<P>>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
template<class T> void vecout(const vector<T> &v,char div='\n') { rep(i,v.size()) cout<<v[i]<<(i==int(v.size()-1)?'\n':div);}
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
template<class... T> void fin(const T&... a) { print(a...); exit(0); }
const string yes[] = {"no","yes"};
const string Yes[] = {"No","Yes"};
const string YES[] = {"NO","YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    LL(n, k, m);
    map<ll, int> mp;
    rep(b, 2, 31) {
        rep(a, 1, linf) {
            bool ok = true;
            ll now = 1;
            rep(i, b + 1) {
                ll l = a + i * k;
                if (now > linf / l) {
                    ok = false;
                    break;
                }
                now *= l;
            }
            if (!ok) break;
            if (now <= n) mp[now]++;
        }
    }
    auto g = [&](ll l) {
        int ok = 0, ng = inf;
        auto f = [&](int x) -> bool {
            if (x + k > linf / x) return false;
            return (ll) x * (x + k) <= l;
        };
        while (abs(ok - ng) > 1) {
            int mid = (ng + ok) / 2;
            if (f(mid)) ok = mid;
            else ng = mid;
        }
        return (ll) ok * (ok + k) == l;
    };
    ll ans = 0, l = 0;
    for (auto[val, cnt] : mp) {
        if (cnt > m) {
            if (g(val)) l++;
            continue;
        }
        if (cnt < m - 1) continue;
        if (cnt == m) {
            if (g(val)) l++;
            else ans++;
        } else {
            if (g(val)) ans++;
        }
    }
    if (m == 1) {
        int ok = 0, ng = inf;
        auto f = [&](int x) -> bool {
            if (x + k > linf / x) return false;
            return (ll) x * (x + k) <= n;
        };
        while (abs(ok - ng) > 1) {
            int mid = (ng + ok) / 2;
            if (f(mid)) ok = mid;
            else ng = mid;
        }
        ans += ok - l;
    }
    print(ans);
}
0