結果
問題 | No.1532 Different Products |
ユーザー | kiyoshi0205 |
提出日時 | 2021-06-04 22:11:50 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 900 ms / 4,000 ms |
コード長 | 4,598 bytes |
コンパイル時間 | 2,638 ms |
コンパイル使用メモリ | 183,756 KB |
実行使用メモリ | 299,024 KB |
最終ジャッジ日時 | 2023-08-12 13:18:52 |
合計ジャッジ時間 | 34,894 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,428 KB |
testcase_01 | AC | 103 ms
50,324 KB |
testcase_02 | AC | 2 ms
5,560 KB |
testcase_03 | AC | 2 ms
5,516 KB |
testcase_04 | AC | 2 ms
5,476 KB |
testcase_05 | AC | 2 ms
5,424 KB |
testcase_06 | AC | 2 ms
5,840 KB |
testcase_07 | AC | 3 ms
5,924 KB |
testcase_08 | AC | 4 ms
6,688 KB |
testcase_09 | AC | 32 ms
24,316 KB |
testcase_10 | AC | 121 ms
64,616 KB |
testcase_11 | AC | 91 ms
52,248 KB |
testcase_12 | AC | 338 ms
145,764 KB |
testcase_13 | AC | 172 ms
96,584 KB |
testcase_14 | AC | 742 ms
247,248 KB |
testcase_15 | AC | 18 ms
14,300 KB |
testcase_16 | AC | 145 ms
58,864 KB |
testcase_17 | AC | 103 ms
59,608 KB |
testcase_18 | AC | 75 ms
49,636 KB |
testcase_19 | AC | 324 ms
138,960 KB |
testcase_20 | AC | 733 ms
248,976 KB |
testcase_21 | AC | 226 ms
83,348 KB |
testcase_22 | AC | 191 ms
93,432 KB |
testcase_23 | AC | 99 ms
64,372 KB |
testcase_24 | AC | 650 ms
229,072 KB |
testcase_25 | AC | 337 ms
127,116 KB |
testcase_26 | AC | 30 ms
20,728 KB |
testcase_27 | AC | 343 ms
111,892 KB |
testcase_28 | AC | 220 ms
86,620 KB |
testcase_29 | AC | 215 ms
70,216 KB |
testcase_30 | AC | 477 ms
148,668 KB |
testcase_31 | AC | 479 ms
151,576 KB |
testcase_32 | AC | 520 ms
175,392 KB |
testcase_33 | AC | 400 ms
136,032 KB |
testcase_34 | AC | 618 ms
216,172 KB |
testcase_35 | AC | 524 ms
174,312 KB |
testcase_36 | AC | 632 ms
210,660 KB |
testcase_37 | AC | 100 ms
38,568 KB |
testcase_38 | AC | 658 ms
224,720 KB |
testcase_39 | AC | 613 ms
200,340 KB |
testcase_40 | AC | 602 ms
204,400 KB |
testcase_41 | AC | 811 ms
290,948 KB |
testcase_42 | AC | 736 ms
258,516 KB |
testcase_43 | AC | 753 ms
270,252 KB |
testcase_44 | AC | 873 ms
294,808 KB |
testcase_45 | AC | 876 ms
295,584 KB |
testcase_46 | AC | 882 ms
286,676 KB |
testcase_47 | AC | 900 ms
298,564 KB |
testcase_48 | AC | 867 ms
295,104 KB |
testcase_49 | AC | 868 ms
296,976 KB |
testcase_50 | AC | 866 ms
294,852 KB |
testcase_51 | AC | 868 ms
297,636 KB |
testcase_52 | AC | 837 ms
292,024 KB |
testcase_53 | AC | 857 ms
298,772 KB |
testcase_54 | AC | 835 ms
292,128 KB |
testcase_55 | AC | 847 ms
296,228 KB |
testcase_56 | AC | 861 ms
286,732 KB |
testcase_57 | AC | 877 ms
288,580 KB |
testcase_58 | AC | 858 ms
293,876 KB |
testcase_59 | AC | 835 ms
277,460 KB |
testcase_60 | AC | 880 ms
299,024 KB |
testcase_61 | AC | 3 ms
5,436 KB |
testcase_62 | AC | 2 ms
5,548 KB |
testcase_63 | AC | 878 ms
296,040 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; using datas=pair<ll,ll>; using ddatas=pair<long double,long double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define popcount __builtin_popcountll #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) // constexpr ll mod=1000000007; constexpr ll mod=998244353; constexpr ll inf=1LL<<60; constexpr long double eps=1e-9; const long double PI=acosl(-1); template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const set<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cout<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);} #define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif inline void startupcpp(void) noexcept{ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } ll modinv(ll a,const ll m=mod) noexcept{ ll b=m,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+m)%m; } ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(const ll n,const ll r) noexcept{ if(n<r)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[n]=modinv(modncrlistp[n]); for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod; } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n,const ll m=mod){ if(n<0)return 0; ll res=1; while(n>0){ if(n&1)res=res*a%m; a=a*a%m; n>>=1; } return res; } constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);} constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;} ll K,K2,val[200001],memo[201][200001]; int N; int valsize; int ind(ll x){return x<=K2?valsize-int(x):int(double(K)/x)-1;} ll calc(int now,ll x){ int i=ind(x); if(memo[now][i])return memo[now][i]; if(now>x)return memo[now][i]=1; if(now==x||now==N)return memo[now][i]=2; return memo[now][i]=calc(now+1,x)+calc(now+1,ll(double(x)/now)); } int main(){ startupcpp(); cin>>N>>K; K2=sqrtl(K); for(ll now=K;now;now=K/(K/now+1)){ val[valsize]=now; valsize++; } print(calc(1,K)-1); }