# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950458 | ALTAKEXE | Jelly Flavours (IOI20_jelly) | C++14 | 34 ms | 604 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>
#define ll long long int
#define f first
#define s second
#define pii pair<ll, ll>
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b)
{
ll n = a.size(), i;
vector<pii> v(n);
for (ll i = 0; i < n; i++)
v.push_back({a[i], b[i]});
sort(v.begin(), v.end());
vector<ll> dp;
vector<ll> d(x + 1, 0);
for (ll i = 0; i < n; i++)
{
ll ok = 0;
dp = vector<ll>(x + 1, INT_MAX);
for (ll j = 0; j <= x; j++)
{
dp[j] = d[j] + v[i].s;
if (j - v[i].f >= 0)
dp[j] = min(dp[j], d[j - v[i].f]);
if (dp[j] <= y)
ok |= 1;
}
if (!ok)
break;
swap(dp, d);
}
return i;
}
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... |