# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73312 | Sa1378 | Ancient Books (IOI17_books) | C++17 | 234 ms | 16284 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
#define N ((int)1001*1000)
int n;
ll prt[N],ans;
ll minimum_walk(vector<int> p, int s)
{
if(s)return 0;
n=p.size();
for(int i=0;i<n;i++)
{
prt[min(i,p[i])]++;
prt[max(i,p[i])]--;
}
for(int i=0;i<n;i++)
{
if(i)prt[i]+=prt[i-1];
ans+=prt[i];
}
if(!ans)return ans;
int maxi;
for(int i=n-1;i>=0;i--)
if(prt[i])
{
maxi=i;
break;
}
for(int i=0;i<=maxi;i++)
if(!prt[i])
ans+=2;
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... |