# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
613740 | drdilyor | Ancient Books (IOI17_books) | C++17 | 1 ms | 340 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>
#include "books.h"
#ifdef ONPC
#include "t_debug.cpp"
#else
#define debug(...) 42
#endif
#define sz(a) ((int)(a).size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll INFL = 1e18;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }
const int N = 2e5, LOGN = 17, MOD = 1e9+7;
long long minimum_walk(std::vector<int> p, int s) {
int n = sz(p);
vector<vector<int>> cycles;
vector<int> done(n);
int distance = 0;
int mnstart = -1;
for (int i = 0; i < n; i++) {
distance += abs(p[i] - i);
if (done[i]) continue;
if (p[i] == i) continue;
done[i] = true;
if (mnstart==-1) mnstart =i;
cycles.push_back({i});
for (int cur = p[i]; !done[cur]; cur = p[cur]) {
cycles.back().push_back(cur);
done[cur] = true;
debug(cycles.back());
}
}
return distance + (mnstart == -1 ? 0 : mnstart * 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... |