# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318659 | SnowFlake7 | Jelly Flavours (IOI20_jelly) | C++14 | 176 ms | 78696 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 "jelly.h"
#include <bits/stdc++.h>
#define NMAX 2005
#define INF 2000000000
using namespace std;
struct jelly {
int a,b;
};
jelly v[NMAX];
int dp[NMAX][10005],cost[NMAX];
bool cmp1(jelly a, jelly b) {
return a.a < b.a;
}
bool cmp2(jelly a, jelly b) {
return a.b < b.b;
}
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int ind,ans = 0,n = a.size(),rest;
for (int i = 1;i <= n;i++)
v[i] = {a[i - 1], b[i - 1]};
sort(v + 1, v + n + 1, cmp1);
for (int i = 0;i <= n;i++) {
for(int j = 0;j <= y;j++)
dp[i][j] = INF;
}
dp[0][0] = 0;
for (int i = 1;i <= n;i++) {
# | 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... |