Submission #1207813

#TimeUsernameProblemLanguageResultExecution timeMemory
1207813simona1230Packing Biscuits (IOI20_biscuits)C++20
47 / 100
775 ms282372 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; long long p[64]; long long ans,nd,b[64]; long long s[64]; vector<long long> v; long long dp[64][600001]; long long count_tastiness(long long x, std::vector<long long> a) { p[0]=1; for(int i=1; i<60; i++) p[i]=p[i-1]*2; while(a.size()<60)a.push_back(0); if(x<=10000) { for(int i=0;i<a.size();i++) { if(a[i]>=x) { long long lf=a[i]-x; a[i]=x+lf%(2*x); a[i+1]+=lf/(2*x); } } dp[60][0]=1; for(int i=59;i>=0;i--) { //cout<<a[i]<<" "; for(int j=0;j<=600000;j++) { dp[i][j]=0; if((j+a[i])/2<=600000)dp[i][j]=dp[i+1][(j+a[i])/2]; if(j+a[i]>=x&&(j+a[i]-x)/2<=600000)dp[i][j]+=dp[i+1][(j+a[i]-x)/2]; //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl; } } //cout<<endl; return dp[0][0]; cout<<dp[0][0]<<endl; } s[0]=a[0]; for(int i=1; i<60; i++) { s[i]=s[i-1]; if(i<a.size())s[i]+=a[i]*p[i]; } nd=x; ans=0; v.clear(); v.push_back(0); for(int i=0;i<60;i++) { int sz=v.size(); int j=0; while(j<sz&&(v[j]+p[i])<=s[i]/nd) { v.push_back(v[j]+p[i]); j++; } } //cout<<"? "<<v.size()<<endl; return v.size(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...