# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832288 | MadokaMagicaFan | Ancient Books (IOI17_books) | C++14 | 105 ms | 24624 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 "bits/stdc++.h"
using namespace std;
using ll = long long;
#define sz(v) ((int)v.size())
#define pb push_back
const int N = 1e6;
bitset<N> v;
ll minimum_walk(vector<int> p, int s) {
/* assumes s = 0 */
ll ans = 0;
int n = sz(p);
v = 0;
for (int i = 0; i < n; ++i)
ans += (ll)abs(i - p[i]);
vector<array<ll,2>> rn, newr;
for (int i = 0; i < n; ++i) {
int l, r, x;
l = r = i;
if (v[i]) continue;
x = i;
while (!v[x]) {
v[x] = 1;
l = min(l, x);
r = max(r, x);
x = p[x];
}
if (l != r)
# | 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... |