Submission #1227902

#TimeUsernameProblemLanguageResultExecution timeMemory
1227902omsincoconutPacking Biscuits (IOI20_biscuits)C++17
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll count_tastiness(ll x, vector<ll> a) { vector<ll> can = {0}; for (ll i = 0; i < a.size(); i++) { vector<ll> nextcan; for (ll j : can) { nextcan.push_back(a[i]*(1LL<<i)+j); ll val = (a[i]-x)*(1LL<<i)+j; if (val >= 0) nextcan.push_back(val); } can = nextcan; } return can.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...