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 all(a) (a).begin(), (a).end()
#define vi vector<int>
#define ff first
#define ss second
#define ll long long
struct Fenwick{
vector<int> t;
};
long long minimum_walk(vector<int> p, int s) {
int n = p.size();
ll tot = 0;
vector<int> used(n);
for(int i=0; i<n; i++){
tot += abs(i - p[i]);
int mn = min(i, p[i]);
int mx = max(i, p[i]);
for(int j = mn; j < mx; j++){
used[j] = 1;
}
}
int r = n-1;
while(r >=0 && used[r]==0) r--;
//cout << r << endl;
// cout << "done" << endl;
ll cnt = 0;
for(int i = 0; i <=r; i ++){
cnt += used[i]==0;
}
return tot + cnt*2;
}
# | 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... |