# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392747 | phathnv | Jelly Flavours (IOI20_jelly) | C++14 | 199 ms | 154696 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "jelly.h"
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b){
int n = a.size();
vector<int> ind(n);
for(int i = 0; i < n; i++)
ind[i] = i;
sort(ind.begin(), ind.end(), [&](const int &x, const int &y){
return b[x] < b[y];
});
pair<int, int> dp[n + 1][x + 1];
for(int i = 0; i <= n; i++)
for(int j = 0; j <= x; j++)
dp[i][j] = {0, 0};
dp[0][x] = {0, y};
for(int i = 0; i < n; i++)
for(int j = 0; j <= x; j++){
if (j >= a[ind[i]])
dp[i + 1][j - a[ind[i]]] = max(dp[i + 1][j - a[ind[i]]], {dp[i][j].first + 1, dp[i][j].second});
if (dp[i][j].second >= b[ind[i]])
dp[i + 1][j] = max(dp[i + 1][j], {dp[i][j].first + 1, dp[i][j].second - b[ind[i]]});
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
}
int res = 0;
for(int j = 0; j <= x; j++)
res = max(res, dp[n][j].first);
return res;
}
Compilation message (stderr)
# | 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... |