# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49209 | MatheusLealV | Ancient Books (IOI17_books) | C++17 | 3 ms | 812 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>
#define N 1000005
using namespace std;
typedef long long ll;
int G[N], ok[N], cor, sz[N], C[N];
void dfs(int x)
{
if(ok[G[x]]) return;
ok[G[x]] = 1;
dfs(G[x]);
}
void co(int x)
{
if(C[G[x]]) return;
C[G[x]] = cor, sz[cor] ++;
co(G[x]);
}
ll minimum_walk(vector<int> p, int s)
{
ll ans = 0;
for(int i = 0; i < p.size(); i++) G[i] = p[i], ans += abs(i - p[i]);
for(int i = 0; i < p.size(); i++)
{
if(C[i]) continue;
++cor;
C[i] = cor;
sz[cor] = 1;
co(i);
}
while(s >= 0)
{
dfs(s);
int prox = -1, d = 2000000000;
for(int i = 0; i < p.size(); i++)
{
if(ok[i] || sz[C[i]] <= 1) continue;
if(abs(s - i) < d)
{
d = abs(s - i);
prox = i;
}
}
if(prox == -1) ans += s;
else ans += d;
s = prox;
}
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... |