제출 #1304215

#제출 시각아이디문제언어결과실행 시간메모리
1304215Zone_zoneeJelly Flavours (IOI20_jelly)C++20
35 / 100
66 ms1420 KiB
#include "jelly.h" #include <vector> int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) { const int N = 2e3+10, M = 5e2+10; int dp[M][M] = {}; int n = a.size(); for(int i = 1; i <= n; ++i){ for(int j = x; j >= 0; --j){ for(int k = y; k >= 0; --k){ if(j >= a[i-1]) dp[j][k] = std::max(dp[j][k], dp[j-a[i-1]][k]+1); if(k >= b[i-1]) dp[j][k] = std::max(dp[j][k], dp[j][k-b[i-1]]+1); } } } return dp[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...