# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061405 | Zicrus | Ancient Books (IOI17_books) | C++17 | 1 ms | 348 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>
#include "books.h"
using namespace std;
typedef long long ll;
ll minimum_walk(vector<int> p, int s) {
ll n = p.size();
ll res = 0;
ll ooo = 0;
for (int i = 0; i < n; i++) ooo += (p[i] != i);
vector<bool> vst(n);
ll mxId;
for (int i = 0; i < n; i++) {
if (vst[i]) continue;
if (p[i] == i) {
vst[i] = true;
continue;
}
ll cur = mxId = i;
do {
res += abs(cur - p[cur]);
cur = p[cur];
ooo--;
vst[cur] = true;
} while (cur != i);
}
return 2*mxId + res;
}
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... |