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;
typedef long long ll;
ll minimum_walk(vector<int> p, int s) {
int trueLength = p.size();
for (int i = p.size() - 1; i >= 0; i--)
{
if (p[i] == i)
{
trueLength--;
}
else
{
break;
}
}
ll toRet = 0;
int startPoint = 0;
int maxSoFar = -1;
for (int i = 0; i < trueLength; i++)
{
maxSoFar = max(maxSoFar, p[i]);
if (maxSoFar == i)
{
for (int j = startPoint; j <= i; j++)
{
toRet += abs(j - p[j]);
}
if (i < trueLength - 1)
{
toRet += abs(startPoint - (i+1));
startPoint = i+1;
}
}
}
toRet += startPoint;
return toRet;
}
# | 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... |