# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74374 | nvmdava | Ancient Books (IOI17_books) | C++17 | 209 ms | 13396 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;
int r = -1, l = 1000001;
vector<int> p;
bool in[1000001];
int cl = -1;
int s;
int cr = 1000001;
void go(int v){
if(in[v] == 1){
return;
}
if(v <= s){
cl = max(cl, v);
} else {
cr = min(cr, v);
}
in[v] = 1;
r = max(r, v);
go(p[v]);
}
long long minimum_walk(vector<int> p, int s) {
::p = p;
::s = s;
int q = 0;
long long ans = 0;
for(int i = 0; i < p.size(); i++){
ans += (long long)abs(i - p[i]);
if(in[i] || p[i] == i) continue;
l = min(l, i);
if(r < i && r != -1){
ans += (long long)(i - r) * 2;
}
go(i);
}
if(in[s] == 0){
if(cl != -1 && cr != 1000001) ans +=2 * min(s - cl, cr - s);
else if(cl != -1) ans += 2 * (s - cl);
else if(cr != 1000001) ans += 2 * (cr - s);
}
return ans;
}
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... |