# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673215 | Hacv16 | Jelly Flavours (IOI20_jelly) | C++17 | 69 ms | 94340 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;
const int MAXN = 2e3 + 10;
const int MAXM = 1e4 + 10;
const int INF = 0x3f3f3f3f;
int dp[MAXN][MAXM];
int dp2[MAXN][MAXM];
int n, a[MAXN], b[MAXN];
vector<pair<int, int>> buga;
int find_maximum_unique(int x, int y, vector<int> _a, vector<int> _b) {
n = _a.size();
if (x > y) {
swap(x, y);
swap(_a, _b);
}
for (int i = 0; i < n; i++) {
buga.emplace_back(_a[i], _b[i]);
}
sort(buga.begin(), buga.end());
for (int i = 1; i <= n; i++) {
a[i] = buga[i - 1].first;
b[i] = buga[i - 1].second;
# | 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... |