# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757560 | 1bin | Jelly Flavours (IOI20_jelly) | C++14 | 133 ms | 156940 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;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e6 + 5;
int dp[2003][10004], dp2[2003][10004];
vector<pair<int, int>> v;
int find_maximum_unique(int Amx, int Bmx, vector<int> a, vector<int> b) {
int n = a.size(), ans = 0;
for(int i = 0; i < n; i++) v.emplace_back(a[i], b[i]);
sort(all(v));
for(int i = 1; i <= n; i++){
auto&[a, b] = v[i - 1];
for(int j = Amx; j >= a; j--) dp[i][j] = min(dp[i - 1][j] + b, dp[i - 1][j - a]);
for(int j = a - 1; j >= 0; j--) dp[i][j] = dp[i - 1][j] + b;
if(dp[i][Amx] <= Bmx) ans = i;
}
for(int i = n; i; i--){
auto&[a, b] = v[i - 1];
for(int j = Bmx; j >= 0; j--){
dp2[i][j] = dp2[i + 1][j];
if(j >= b) dp2[i][j] = max(dp2[i][j], dp2[i + 1][j - b] + 1);
}
if(dp[i - 1][Amx] <= Bmx) ans = max(ans, i - 1 + dp2[i][Bmx - dp[i - 1][Amx]]);
}
return ans;
}
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... |