Submission #1207648

#TimeUsernameProblemLanguageResultExecution timeMemory
1207648simona1230Packing Biscuits (IOI20_biscuits)C++20
9 / 100
1096 ms424 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; long long p[64],h[64]; long long ans,nd,b[64]; long long s[64]; void dfs(int i,long long curr) { //cout<<i<<" "<<curr<<endl; ans++; for(int j=i+1; j<60; j++) { if(curr+p[j]<=s[j]/nd) dfs(j,curr+p[j]); } } 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; s[0]=a[0]; for(int i=1;i<60;i++) { //cout<<p[i]<<endl; s[i]=s[i-1]; if(i<a.size())s[i]+=a[i]*p[i]; } nd=x; ans=0; dfs(-1,0); return ans; }
#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...