# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080688 | andrei_iorgulescu | Ancient Books (IOI17_books) | C++14 | 1 ms | 4708 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"
#warning That's not FB, that's my FB
using namespace std;
using ll = long long;
int n, s;
int p[1000005], pos[1000005];
vector<vector<int>> cyc;
vector<int> cur;
bool viz[1000005];
void dfs(int nod)
{
viz[nod] = true;
cur.push_back(nod);
if (!viz[p[nod]])
dfs(p[nod]);
}
ll minimum_walk(vector<int> PERM, int STR)
{
cyc.clear();
memset(viz,0,sizeof(viz));
n = PERM.size();
for (int i = 1; i <= n; i++)
p[i] = PERM[i - 1] + 1, pos[p[i]] = i;
s = STR;
for (int i = 1; i <= n; i++)
{
if (!viz[i])
{
cur.clear();
dfs(i);
cyc.push_back(cur);
}
}
ll ans = 0;
for (auto it : cyc)
if (it.size() != 1)
ans = max(ans, 2ll * it[0]);
for (auto it : cyc)
{
for (int i = 0; i + 1 < it.size(); i++)
ans += abs(it[i] - it[i + 1]);
}
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... |