Submission #600991

#TimeUsernameProblemLanguageResultExecution timeMemory
600991PiejanVDCPacking Biscuits (IOI20_biscuits)C++17
21 / 100
1088 ms63344 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; int K = 60; long long X; vector<long long>v; vector<map<long long, long long>>mp; long long dp(int i, long long cnt) { if(i == K) return 1; if(mp[i].count(cnt)) return mp[i][cnt]; long long ret = 0; if(cnt + v[i] >= X) ret = dp(i+1, (cnt + v[i] - X)/2); ret += dp(i+1, (cnt+v[i])/2); return mp[i][cnt] = ret; } long long count_tastiness(long long x, vector<long long>a) { X = x; v = a; for(int i = a.size() ; i < K ; i++) v.push_back(0); mp.clear(); mp.resize(K); return dp(0, 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...