# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40150 | alenam0161 | Ancient Books (IOI17_books) | C++14 | 1 ms | 3000 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 "books.h"
#include <iostream>
using namespace std;
const int N = 1e6 + 7;
bool used[N];
vector<int> cycl,a;
long long ans;
void dfs(int v) {
used[v] = true;
cycl.push_back(v);
ans += abs(a[v] - v);
if (used[a[v]])return;
dfs(a[v]);
}
long long minimum_walk(std::vector<int> p, int s) {
a = p;
int n = p.size();
vector<pair<long long,int>> ms;
for (int i = 0; i < n; ++i) {
if (used[i])continue;
ans = 0;
cycl.clear();
dfs(i);
ms.push_back({ ans,i });
}
while (ms.size() > 0 && ms.back().first == 0)ms.pop_back();
long long an = 0;
for (int i = 0; i < ms.size(); ++i) {
an += ms[i].first;// cout << ms[i].first << " " << ms[i].second << endl;
}
an += ms.back().second * 2;
return an;
}
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... |