# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421445 | schse | Ancient Books (IOI17_books) | C++17 | 1 ms | 204 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"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
struct unionfind
{
vector<int> root = vector<int>(1005);
int find(int i)
{
if (root[i] == i)
return i;
return root[i] = find(root[i]);
}
bool unite(int a, int b)
{
a = find(a);
b = find(b);
if (a == b)
return false;
root[a] = b;
return true;
}
} un;
struct qnode
{
int dis, a, b;
};
long long minimum_walk(std::vector<int> p, int s)
{
iota(un.root.begin(), un.root.end(), 0);
vector<int> cycle(p.size(), -1);
vector<vector<int>> cycles;
vector<pair<int, int>> cmmc;
long long triplenght = 0;
for (int i = 0; i < p.size(); i++)
{
if (cycle[i] == -1 && p[i] != i)
{
int t = i;
cycles.push_back({});
cmmc.push_back({INT32_MIN, INT32_MAX});
do
{
cmmc[cmmc.size() - 1].first = min(cmmc[cmmc.size() - 1].first, t);
cmmc[cmmc.size() - 1].second = max(cmmc[cmmc.size() - 1].second, t);
cycles[cycles.size() - 1].push_back(t);
cycle[t] = cycles.size();
triplenght += abs(t - p[t]);
t = p[t];
} while (t != i);
}
}
if (cmmc.size() == 0)
return 0;
triplenght += 2 * cmmc[0].first; //initial walk
int mx = cmmc[0].second;
for (int i = 1; i < cmmc.size(); i++)
{
if (mx < cmmc[i].first)
triplenght += abs(cmmc[i].first - cmmc[i - 1].second) * 2;
mx = max(mx, cmmc[i].second);
}
return triplenght;
}
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... |