Submission #605432

#TimeUsernameProblemLanguageResultExecution timeMemory
605432HamletPetrosyanPacking Biscuits (IOI20_biscuits)C++17
0 / 100
38 ms596 KiB
#include "biscuits.h" #include <iostream> #include <map> using namespace std; #define ll long long #define add push_back #define len(a) ((int)(a).size()) #define fr first #define sc second long long count_tastiness(long long x, vector<long long> a) { map<ll, ll> dp[70]; dp[0][0] = 1; for(int i = 0; i < len(a) + 7; i++){ for(auto v : dp[i]){ dp[i + 1][((v.fr + ((i >= len(a)) ? 0 : a[i])) / 2)] += v.sc; if(((i >= len(a)) ? 0 : a[i]) + v.fr >= x) dp[i + 1][(v.fr + ((i >= len(a)) ? 0 : a[i]) - x) / 2] += v.sc; } } return dp[len(a) + 7][0]; }
#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...