# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25738 | minimario | Swap (BOI16_swap) | C++14 | 393 ms | 27752 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>
using namespace std;
const int MAX = 200005;
int sz;
int ar[MAX];
map<pair<int, int>, int > memo;
int dp(int n, int v) {
if (memo.find({n, v}) != memo.end()) {
return memo[{n, v}];
}
if (2*n+1 <= sz) {
if (v < ar[2*n] && v < ar[2*n+1]) { }
else if (ar[2*n] < v && ar[2*n] < ar[2*n+1]) {
memo[{n, v}] = dp(2*n, v);
return memo[{n, v}];
}
else if (ar[2*n+1] < ar[2*n] && ar[2*n+1] < v) {
if (v > ar[2*n]) {
if (dp(2*n, ar[2*n]) < dp(2*n+1, ar[2*n])) {
memo[{n, v}] = dp(2*n+1, v);
}
else {
memo[{n, v}] = dp(2*n, v);
}
}
else { memo[{n, v}] = min(dp(2*n, v), dp(2*n+1, v)); }
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... |