# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165275 | Segtree | Ancient Books (IOI17_books) | C++14 | 0 ms | 0 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<iostream>
#include<vector>
#include"books.h"
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 1000010
ll minimum_walk(vector<int> p,int s){
int n=p.size();
ll sum=0;
for(int i=0;i<n;i++)sum+=abs(i-p[i]);
bool vis[N];
for(int i=0;i<n;i++)vis[i]=0;
vector<pair<ll,ll> >v;
for(int i=0;i<n;i++){
if(vis[i])continue;
ll x=i;
ll mi=1e17,ma=-1e17;
while(1){
chmin(mi,x);
chmax(ma,x);
vis[x]=1;
x=p[x];
if(x==i)break;
}
v.push_back(make_pair(mi,ma));
}
sort(v.begin(),v.end());
ll rnd=0;
for(int i=0;i<v.size();i++){
if(rnd<v[i].first)sum+=2*(v[i].first-rnd);
chmax(rnd,v[i].second);
}
return sum;
}