Submission #1031280

#TimeUsernameProblemLanguageResultExecution timeMemory
1031280happy_nodePacking Biscuits (IOI20_biscuits)C++17
9 / 100
1051 ms1378428 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; long long count_tastiness(long long X, std::vector<long long> a) { while(a.size()<60) a.push_back(0); vector<ll> good; // set of good y's good.push_back(0); ll sum=0; for(int b=0;b<60;b++) { ll c=1LL<<b; sum+=a[b]*c; int s=good.size(); for(int i=0;i<s;i++) { ll y=good[i]+c; if(y<=sum/X) good.push_back(y); else break; } } return good.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...