| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 165302 | Segtree | 고대 책들 (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<algorithm>
#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]);
if(sum==0)return 0;
bool vis[N];
for(int i=0;i<n;i++)vis[i]=0;
vector<pair<int,int> >v;
bool th=0;
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;
}
if(mi!=ma){
v.push_back(make_pair(mi,ma));
if(mi<=s&&s<=ma)th=1;
}
}
if(th==0)v.push_back(make_pair(s,s));
sort(v.begin(),v.end());
vector<P> nv;
int rnd=-1;
for(int i=0;i<v.size();i++){
if(rnd<v[i].second){
nv.push_back(v[i]);
rnd=v[i].second;
}
}
v=nv;
ll bef=v[0].first;
for(int i=0;i<v.size();i++){
if(~rnd&&rnd<v[i].first){
v.push_back(make_pair(bef,rnd));
bef=v[i].first;
sum+=2*(v[i].first-rnd);
}
chmax(rnd,v[i].second);
}
if(th==1){
int mi=1e9;
for(int i=0;i<v.size();i++){
chmin(mi,abs(s-v[i].first));
chmin(mi,abs(s-v[i].second));
}
if(mi==1e9)return 0;
if(mi==0)cout<<1/0<<endl;
//sum+=mi*2;
}
return sum;
}