# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598190 | yanndev | Ancient Books (IOI17_books) | C++17 | 2090 ms | 340 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>
#define ll long long
using namespace std;
ll minimum_walk(vector<int> p, int s) {
ll ans = 1e9;
int n = (int)p.size();
vector<vector<int>> cycles {};
vector<bool> vis (n, false);
int last = 0;
for (int i = 0; i < n; i++) {
if (vis[i])
continue;
//ans += abs(i - last);
int pos = i;
last = i;
cycles.push_back({});
while (!vis[pos]) {
vis[pos] = true;
cycles.back().push_back(pos);
//ans += abs(p[pos] - pos);
pos = p[pos];
}
}
//ans += last;
vector<int> perm {};
for (int i = 0; i < (int)cycles.size(); i++)
perm.push_back(i);
do {
ll sub = 0;
int lst = 0;
for (int i = 0; i < (int)cycles.size(); i++) {
for (auto& x: cycles[i]) {
sub += abs(x - lst);
lst = x;
}
}
sub += lst;
ans = min(ans, sub);
} while (next_permutation(perm.begin(), perm.end()));
return ans;
}
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... |