結果
問題 | No.1383 Numbers of Product |
ユーザー | yuto1115 |
提出日時 | 2021-02-07 21:28:05 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,376 bytes |
コンパイル時間 | 2,215 ms |
コンパイル使用メモリ | 206,580 KB |
実行使用メモリ | 68,340 KB |
最終ジャッジ日時 | 2023-09-17 20:35:25 |
合計ジャッジ時間 | 23,135 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
4,380 KB |
testcase_01 | AC | 36 ms
4,376 KB |
testcase_02 | AC | 35 ms
4,376 KB |
testcase_03 | AC | 35 ms
4,376 KB |
testcase_04 | AC | 36 ms
4,376 KB |
testcase_05 | AC | 35 ms
4,376 KB |
testcase_06 | AC | 35 ms
4,376 KB |
testcase_07 | AC | 508 ms
43,100 KB |
testcase_08 | AC | 495 ms
42,640 KB |
testcase_09 | AC | 340 ms
51,920 KB |
testcase_10 | AC | 811 ms
67,516 KB |
testcase_11 | AC | 798 ms
66,512 KB |
testcase_12 | AC | 808 ms
67,292 KB |
testcase_13 | AC | 767 ms
64,772 KB |
testcase_14 | AC | 657 ms
55,276 KB |
testcase_15 | AC | 538 ms
45,424 KB |
testcase_16 | AC | 806 ms
66,824 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,376 KB |
testcase_20 | AC | 1 ms
4,376 KB |
testcase_21 | AC | 1 ms
4,376 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 2 ms
4,380 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 1 ms
4,376 KB |
testcase_27 | AC | 1 ms
4,376 KB |
testcase_28 | AC | 5 ms
4,380 KB |
testcase_29 | AC | 628 ms
53,204 KB |
testcase_30 | AC | 815 ms
68,236 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 103 ms
16,748 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 1 ms
4,376 KB |
testcase_35 | AC | 412 ms
62,512 KB |
testcase_36 | AC | 708 ms
59,960 KB |
testcase_37 | AC | 811 ms
68,332 KB |
testcase_38 | AC | 825 ms
68,144 KB |
testcase_39 | AC | 449 ms
68,264 KB |
testcase_40 | AC | 451 ms
68,208 KB |
testcase_41 | AC | 810 ms
68,160 KB |
testcase_42 | AC | 818 ms
68,220 KB |
testcase_43 | AC | 811 ms
68,340 KB |
testcase_44 | AC | 452 ms
68,252 KB |
testcase_45 | AC | 820 ms
68,252 KB |
testcase_46 | AC | 1 ms
4,380 KB |
testcase_47 | AC | 787 ms
66,608 KB |
testcase_48 | AC | 796 ms
67,204 KB |
testcase_49 | AC | 814 ms
67,932 KB |
testcase_50 | WA | - |
testcase_51 | AC | 1 ms
4,376 KB |
testcase_52 | AC | 2 ms
4,376 KB |
ソースコード
//@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 ok * (ok + k) == l; }; ll ans = 0, l = 0; for (auto[val, cnt] : mp) { if (cnt > m) 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; ans -= l; } print(ans); }