# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921302 | salmon | 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 <bits/stdc++.h>
using namespace std;
pair<int,int> expand_range(int l, int r, int h){
int l1 = min(l,h);
int r1 = max(r,h);
while(l1 != l || r1 != r){
if(l1 != l){
l--;
l1 = min(l1,l[parent[l]);
r1 = max(r1,r[parent[l]);
}
else{
r++;
l1 = min(l1,l[parent[r]);
r1 = max(l1,r[parent[r]);
}
}
return {l,r};
}
long long minimum_walk(vector<int> p, int s) {
int parent[1100100];
int v[1100100];
bool done[1100100];
int l[1100100];
int r[1100100];
int l1 = s;
int r1 = s;
int l2 = s;
int r2 = s;
long long int some = 0;
int N = p.size();
for(int i = 0; i < N; i++){
done[i] = false;
}
for(int i = 0; i < N; i++){
if(done[i]) continue;
l[i] = i;
r[i] = i;
parent[i] = i;
int j = p[i];
some += abs(i - j);
while(j != i){
int temp = j;
parent[j] = i;
done[j] = true;
r[i] = max(r[i],j);
j = p[j];
some += abs(temp - j);
}
}
l2 = l[parent[s]];
r2 = r[parent[s]];
while(l1 != l2 || r1 != r2){
if(l1 != l2){
l1--;
l2 = min(l2,l[parent[l1]);
r2 = max(r2,r[parent[l1]);
}
else{
r1++;
l2 = min(l2,l[parent[r1]);
r2 = max(r2,r[parent[r1]);
}
}
int l3l = l1;
int r3l = r1;
int l3r = l1;
int r3r = r1;
while(l1 != 0 && r1 != N - 1){
int coft = 0;
l3l = l1;
r3l = r1;
l3r = l1;
r3r = r1;
while(r1 < r3l && l3r < l1){
coft += 2;
if(l3l >= 0){
pair<int,int> ii = expand_range(l3l-1,r3l,l3l);
l3l = ii.first;
r3l = ii.second;
}
if(r3r < N){
ii = expand_range(l3r,r3r,r3r+1);
}
if(l3l >= 0 && r3r < N){
sum += coft;
break;
}
}
sum += coft;
l1 = min(l3l,l1);
l1 = min(l3r,l1);
r1 = max(r31,r1);
r1 = max(r3r,r1);
}
return soom;
}