# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340984 | pggp | Ancient Books (IOI17_books) | C++14 | 1 ms | 364 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;
bool used[1000000];
vector < int > P;
int N;
int cur_cycle;
int cycle[1000000];
vector < vector < int > > cycs;
vector < int > l_cyc, r_cyc;
long long ans = 0;
void dfs(int vertex){
cycle[vertex] = cur_cycle;
cycs[cur_cycle].push_back(vertex);
used[vertex] = true;
ans += abs(vertex - P[vertex]);
if(!used[P[vertex]]){
dfs(P[vertex]);
}
}
long long minimum_walk(vector < int > p, int s){
N = p.size();
P = p;
cur_cycle = 0;
for (int i = 0; i < N; ++i)
{
if(!used[i]){
vector < int > v;
cycs.push_back(v);
dfs(i);
cur_cycle++;
}
}
vector < pair < int, int > > f;
for (int i = 0; i < cycs.size(); ++i)
{
int l_cyc = 1000000;
int r_cyc = 0;
for(int v : cycs[i]){
l_cyc = min(l_cyc, v);
r_cyc = max(r_cyc, v);
}
f.push_back(make_pair(l_cyc, r_cyc));
}
sort(f.begin(), f.end());
int components = 1;
int max_r = f[0].second;
for (int i = 1; i < f.size(); ++i)
{
if(f[i].first > max_r){
components++;
}
max_r = max(max_r, f[i].second);
}
if(components > 1){
ans += components;
}
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... |