# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
804549 | Benmath | Ancient Books (IOI17_books) | C++14 | 97 ms | 21724 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;
long long minimum_walk(std::vector<int> p, int s) {
long long int sum=0;
int n=p.size();
int vis[n];
for(int i=0;i<n;i++){
vis[i]=0;
}
long long int sad=0;
vector<pair<int,int> >v;
for(int i=0;i<n;i++){
if(vis[i]==0 and i!=p[i]){
int maxi=i;
sad=i;
int i1=i;
int t1=0;
long long int iduci=p[i];
long long int tren=i;
while(t1==0){
sum=sum+abs(iduci-tren);
vis[tren]++;
if(tren>maxi){
maxi=tren;
}
tren=iduci;
iduci=p[tren];
if(tren==i1){
break;
}
}
v.push_back({i,maxi});
}
}
int m=v.size();
if(m==0){
return 0;
}
int so[m];
so[0]=v[0].second;
for(int i=1;i<m;i++){
so[i]=max(so[i-1],v[i].second);
}
sad=0;
for(int i=v.size()-1;i>=0;i--){
long long int x=v[i].first;
long long int maxi1=0;
int t1=0;
if(i!=0){
maxi1=so[i-1];
}
long long int zero=0;
sum=sum+2*max((x-maxi1),zero);
}
return sum;
}
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... |