Submission #1304217

#TimeUsernameProblemLanguageResultExecution timeMemory
1304217Zone_zoneeJelly Flavours (IOI20_jelly)C++20
10 / 100
12 ms472 KiB
#include "jelly.h" #include <vector> #include <cstring> int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) { const int N = 2e3+10, M = 1e4+10; int ans = 0; int dp1[M]; memset(dp1, 0, sizeof dp1); int n = a.size(); for(int i = 0; i < n; ++i){ for(int j = x; j >= a[i]; --j){ dp1[j] = std::max(dp1[j], dp1[j-a[i]]+1); } } ans = dp1[x]; int left = n - ans; if(left*b[0] <= y) return n; else ans += y/b[0]; 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...
#Verdict Execution timeMemoryGrader output
Fetching results...