# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
613939 | Mr_Husanboy | Ancient Books (IOI17_books) | C++14 | 168 ms | 16964 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 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;
void init(int n){
t.resize(n);
}
void inc(int i, int d = 1){
for(; i<t.size(); i|=i+1) t[i] += d;
}
int get(int i){
int res = 0;
for(; i>=0; i = (i&(i+1))-1) res += t[i];
return res;
}
int get(int l, int r){
return get(r) - get(l-1);
}
};
long long minimum_walk(vector<int> p, int s) {
int n = p.size();
ll tot = 0;
Fenwick tr;
tr.init(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]);
tr.inc(mn,1); tr.inc(mx,-1);
}
int r = n-1;
while(r >=0 && tr.get(r)==0) r--;
//cout << r << endl;
// cout << "done" << endl;
ll cnt = 0;
for(int i = 0; i <=r; i ++){
cnt += tr.get(i)==0;
}
return tot + cnt*2;
}
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... |