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 <vector>
#include <cmath>
using namespace std;
long long minimum_walk(vector<int> a, int s)
{
int n = a.size();
long long ans = 0;
vector<bool> used(n);
for (int i = 0; i < n; ++i)
{
if (!used[i])
{
ans = max(ans, 2LL * i);
int j = i;
do {
used[j] = true;
j = a[j];
} while(j != i);
}
}
for (int i = 0; i < n; ++i)
ans += abs(a[i] - i);
return ans;
}
# | 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... |