# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316588 | lauran | Jelly Flavours (IOI20_jelly) | C++14 | 176 ms | 78840 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;
const int INF = 1e9;
int dp2[2005][10005];
int minim[10005];
int find_maximum_unique(int x, int y, vector <int> a, vector <int> b) {
int n = a.size();
// subtaskul 5
vector <pair<int,int>> c;
for (int i = 0; i < n; i++)
c.push_back({a[i], i});
sort(c.begin(), c.end());
vector <int> aNew, bNew;
for (int i = 0; i < n; i++)
aNew.push_back(a[c[i].second]),
bNew.push_back(b[c[i].second]);
a = aNew, b = bNew;
for (int i = 1; i <= n; i++) {
for (int xx = 0; xx <= x; xx++) {
// iau primele i, consum xx in A; cat consum minim in B?
dp2[i][xx] = INF;
if (xx >= a[i - 1])
dp2[i][xx] = min(dp2[i][xx], dp2[i - 1][xx - a[i - 1]]);
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... |