#include <bits/stdc++.h>
using namespace std;
const int MXV = 2005;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int n=a.size();
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];
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |