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;
using ll = long long;
ll minimum_walk(vector<int> p, int s) {
int n = p.size();
ll ans = 0;
vector<ll> paiu(n + 1, 0);
for(int i = 0; i < n; ++i) {
ans += abs(i - p[i]);
int l = min(i, p[i]);
int r = max(i, p[i]);
if(l != r) {
paiu[l]++;
paiu[r]--;
}
}
ll bruh = 0;
for(int i = 0; i < n - 1; ++i) {
if(i) paiu[i] += paiu[i - 1];
if(!paiu[i]) {
bruh += 2;
} else {
ans += bruh;
bruh = 0;
}
}
return ans;
}
# | 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... |