# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134719 | dvdg6566 | Ancient Books (IOI17_books) | C++14 | 239 ms | 22904 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;
#define MAXN 1001000
typedef long long ll;
ll done[MAXN];
ll N,ans;
ll lst;
long long minimum_walk(std::vector<int> p, int s) {
assert(s==0);
N=p.size();
ll pp = 0;
for (int i=0;i<N;++i){
if (done[i])continue;
if (p[i]==i)continue;
done[i]=1;
ll x = p[i];
ans += p[i] - i;
if (i > lst)ans += (i-lst)*2;
while (x!=i){
lst = max(lst,x);
done[x] = 1;
ans += abs(p[x] - x);
x = p[x];
}
// cout<<lst<<'\n';
}
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... |