# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075991 | amin | Ancient Books (IOI17_books) | C++14 | 1 ms | 348 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 <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();
int o[n+1];
for(int i=0;i<=n;i++)
{
o[i]=0;
}
int pre=0;
ll mi=1000000;
ll ma=0;
for(ll i=0;i<n;i++)
{
if(p[i]!=i&&o[i]==0)
{
mi=min(mi,i);
ma=i;
int x=p[i];
o[i]=1;
while(x!=i)
{
o[x]=1;
x=p[x];
}
}
ans+=abs(p[i]-i);
}
if(mi==1000000)
mi=0;
return ans+ma+mi;
}
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... |