Submission #1304228

#TimeUsernameProblemLanguageResultExecution timeMemory
1304228Zone_zoneeJelly Flavours (IOI20_jelly)C++20
23 / 100
23 ms516 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[2*M]; memset(dp1, 0, sizeof dp1); int n = a.size(); for(int i = 0; i < n; ++i){ a[i] = (b[i] == 0 ? 0 : a[i]); for(int j = x+y; j >= a[i]; --j){ dp1[j] = std::max(dp1[j], dp1[j-a[i]]+1); } } return dp1[x+y]; }
#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...