Submission #1075915

#TimeUsernameProblemLanguageResultExecution timeMemory
1075915aminAncient Books (IOI17_books)C++14
0 / 100
1 ms348 KiB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long minimum_walk(vector<int> p, int s) {
	ll ans=0;
	ll n=p.size();
	ll ma=0;
	ll mi=-1;
	int o[n];
	for(int i=0;i<n;i++)
    {
        o[p[i]]=i;
    }
	for(int i=0;i<n;i++)
    {
        if(p[i]==i)
        {
            continue;
        }
        if(o[i]<i&&p[i]>i)
        {
           if(mi==-1)
            mi=i;
        ma=i;
        }


            ans+=abs(p[i]-i);
    }
    return ans+ma+mi;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...