Submission #547518

#TimeUsernameProblemLanguageResultExecution timeMemory
547518LucaDantasPacking Biscuits (IOI20_biscuits)C++17
9 / 100
1157 ms1288032 KiB
#include "biscuits.h" #include <cassert> #include <algorithm> long long count_tastiness(long long x, std::vector<long long> a) { std::vector<long long> val = {0}; while(a.size() < 60) a.push_back(0); for(int i = 1; i < (int)a.size(); i++) a[i] = (1ll << i) * a[i] + a[i-1]; for(int i = 0; i < 60; i++) { long long pot = (1ll << i); int last = std::upper_bound(val.begin(), val.end(), a[i] / x - (1ll << i)) - val.begin(); for(int j = 0; j < last; j++) val.push_back(val[j] | pot); } return val.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...