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]);
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));
else{cout<<1/0<<endl;
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;
sum+=mi*2;
}
sort(v.begin(),v.end());
int rnd=-1;
for(int i=0;i<v.size();i++){
if(~rnd&&rnd<v[i].first)sum+=2*(v[i].first-rnd);
chmax(rnd,v[i].second);
}
return sum;
}
Compilation message (stderr)
books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:35:17: warning: division by zero [-Wdiv-by-zero]
else{cout<<1/0<<endl;
~^~
books.cpp:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v.size();i++){
~^~~~~~~~~
books.cpp:46:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v.size();i++){
~^~~~~~~~~
# | 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... |