# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061736 | _8_8_ | Ancient Books (IOI17_books) | C++17 | 170 ms | 21204 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;
typedef long long ll;
const int N = 1e6 + 12;
int n;
int c[N];
bool isl[N],isr[N];
long long minimum_walk(vector<int> p, int s) {
n = (int)p.size();
int it = 0;
ll res = 0;
for(int i = 0;i < n;i++) {
res += abs(i - p[i]);
}
for(int i = 0;i < n;i++) {
if(c[i]) continue;
it++;
vector<int> v;
int x = i;
while(c[x] != it) {
c[x] = it;
x = p[x];
v.push_back(x);
}
sort(v.begin(),v.end());
isl[v[0]] = isr[v.back()] = 1;
}
int nn;
for(int i = n - 1;i >= 0;i--) {
if(p[i] != i) {
nn = i;
break;
}
}
int mx = -1;
for(int i = 0;i < nn;i++) {
mx = max(mx,p[i]);
if(mx == i) {
res += 2;
}
}
return res;
}
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... |