# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318230 | Vladth11 | Jelly Flavours (IOI20_jelly) | C++14 | 111 ms | 78824 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>
using namespace std;
typedef pair <int,int> pii;
int dp[2001][10001];
int costb[2001];
int i;
struct ura {
int first, second, poz;
};
ura elem[2001];
bool cmp(ura a, ura b) {
return a.second < b.second;
}
bool cm(ura a, ura b) {
if(a.first == b.first)
return a.second > b.second;
return a.first < b.first;
}
int bad[2001];
int ord[2001];
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int n = a.size();
for(i = 0; i < n; i++)
elem[i] = {a[i], b[i], 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... |