# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075945 | 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();
ll ma=0;
ll mi=-1;
int o[n+1];
for(int i=0;i<=n;i++)
{
o[i]=0;
}
int pre=0;
for(int i=n-1;i>=0;i--)
{
if(p[i]==i)
ans-=2;
else
break;
}
for(int i=0;i<n;i++)
{
pre+=o[i];
if(p[i]==i)
{
if(pre==0)
ans+=2;
}
if(p[i]>i)
{
pre++;
o[p[i]+1]--;
}
ans+=abs(p[i]-i);
}
return ans;
}
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... |