# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977356 | mariaclara | Ancient Books (IOI17_books) | C++17 | 1 ms | 348 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 pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
ll minimum_walk(vector<int> p, int s) {
int n = sz(p);
vector<bool> vis(n);
vector<pii> range;
ll ans;
for(int i = 0; i < n; i++) {
int x = i, m = i;
while(!vis[x]) {
vis[x] = 1;
x = p[x];
m = max(m, x);
}
ans += abs(p[i]-i);
if(i != m) range.pb({i,m});
}
int L = 0;
for(int i = 0; i < sz(range);) {
int l = range[i].fr, r = range[i].sc, j = i;
while(j < sz(range) and range[j].fr < r) {
r = max(r, range[j].sc);
j++;
}
i=j;
L = l;
}
return ans + 2*L;
}
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... |