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;
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
ll minimum_walk(vector<int>p,int s)
{
int n=sz(p);
int mx=0,l=-1,L=-1;
ll ans=0;
for(int i=0;i<n;i++) if(i!=p[i]) l=i;
for(int i=0;i<n;i++)
{
ans+=abs(p[i]-i);
mx=max(mx,p[i]);
if(i!=n-1&&mx==i&&i<=l)
{
ans++;
L=i;
}
}
return ans+L+1;
}
/*
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<minimum_walk({3, 2, 1, 0}, 0);
return 0;
}*/
# | 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... |