Submission #425556

#TimeUsernameProblemLanguageResultExecution timeMemory
425556muhammad_hokimiyonPacking Biscuits (IOI20_biscuits)C++14
0 / 100
2 ms388 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; long long count_tastiness(long long x, std::vector<long long> a) { long long ans = 1; vector<long long> b(101, 0ll); for(int i = 0; i < 100; i++){ if(i < (int)a.size())b[i] += a[i]; b[i + 1] += (b[i] - 1ll) / 2; b[i] = min(b[i], 1ll); } for(int i = 0; i < 100; i++){ if(b[i] > 0ll)ans += ans; } 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...