제출 #1304225

#제출 시각아이디문제언어결과실행 시간메모리
1304225Zone_zoneeJelly Flavours (IOI20_jelly)C++20
14 / 100
24 ms512 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){ ans += (b[i] == 0); for(int j = x+y; j >= a[i]; --j){ dp1[j] = std::max(dp1[j], dp1[j-a[i]]+1); } } ans += dp1[x+y]; 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...