Submission #996329

#TimeUsernameProblemLanguageResultExecution timeMemory
996329RifalPacking Biscuits (IOI20_biscuits)C++14
0 / 100
896 ms428 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 = 0; int siz = a.size(); for(long long i = 0; i <= 100000; i++) { long long cur[siz] = {}; for(int j = 0; j < siz; j++) cur[j] = a[j]; bool ok = true; for(long long j = 0; j < 20; j++) { if((i&(1ll<<j)) > 0) { if(j >= siz) { ok = false; break; } if(cur[j] >= x) { cur[j] -= x; } else { ok = false; break; } } if(!ok) break; if(j+1 < siz && cur[j] != 0) cur[j+1] += (cur[j]/2ll); } if(ok) { 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...