# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474085 | AdamGS | Ancient Books (IOI17_books) | C++14 | 1 ms | 328 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;
typedef long double ld;
#define rep(a, b) for(ll a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1e6+7;
int F[LIM];
int fnd(int x) {
if(F[x]==x) return x;
return F[x]=fnd(F[x]);
}
void uni(int a, int b) {
if(fnd(a)>fnd(b)) {
F[fnd(b)]=fnd(a);
} else {
F[fnd(a)]=fnd(b);
}
}
ll minimum_walk(vector<int>p, int s) {
int n=p.size();
rep(i, n) F[i]=i;
vector<ll>V;
for(auto i : p) V.pb(i);
ll ans=0;
rep(i, V.size()) {
ans+=abs(i-V[i]);
uni(i, V[i]);
}
int l=0, aktma=fnd(0);
while(l<n-1) {
if(aktma==l) ans+=2;
++l;
aktma=max(aktma, fnd(l));
}
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... |