| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1311775 | norrawichzzz | Jelly Flavours (IOI20_jelly) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MXV = 2005;
int find_maximum_unique(int x, int y, int[] a, int[] b) {
int n=sizeof(a)/sizeof(a[0]);
vector<vector<int>> dp(MXV, vector<int>(MXV));
dp[0][0] = 0;
for (int e=0; e<n; e++) {
for (int i=MXV-1; i>=0; i--) {
for (int j=MXV-1; j>=0; j--) {
if (i-a[e] >= 0) dp[i][j] = max(dp[i-a[e]][j]+1, dp[i][j]);
if (j-b[e] >= 0) dp[i][j] = max(dp[i][j-b[e]]+1, dp[i][j]);
}
}
}
return dp[x][y];
}
/*
int main() {
int n,x,y;
cin>> n>> x>> y;
vector<int> a(n),b(n);
for (int i=0; i<n; i++) cin>> a[i];
for (int i=0; i<n; i++) cin>> b[i];
cout<< find_maximum_unique(x,y,a,b);
}*/
