# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74177 | nvmdava | Ancient Books (IOI17_books) | C++17 | 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 "books.h"
int k = 0;
int id[500001], l[500001], r[500001];
long long val[500001];
bool in[1000001];
int x;
void go(int v, long long c){
if(in[v] == 1){
val[k] = c;
k++;
return;
}
if(v <= x){
l[k] = max(v, l[k]);
}
if(v >= x){
r[k] = min(v, r[k]);
}
in[v] = 1;
go(p[v], c + (long long)abs(v - p[v]));
}
long long minimum_walk(std::vector<int> p, int s) {
x = s;
memset(r, -1, sizeof r);
memset(l, 0x3f, sizeof l);
for(int i = 0; i < p.size(); i++){
if(in[i] || p[i] == i) continue;
go(i, 0LL);
}
long long ans = 0;
int loc = -1;
for(int i = 0; i < k; i++){
ans += val[i];
loc = max(loc, r[i]);
}
ans += (long long) loc;
return ans;
}