# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425491 | Charis02 | 고대 책들 (IOI17_books) | C++14 | 1 ms | 332 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<iostream>
#include<vector>
#include<map>
#define ll long long
#define rep(i,a,b) for(int i = a;i < b;i++)
#define mp(a,b) make_pair(a,b)
#define N 100003
using namespace std;
bool vis[N];
int abso(int x)
{
return (x < 0) ? -x : x;
}
ll get_cycle_cost(vector < int > c)
{
if(c.size()==1)
return 0;
ll res = 0;
rep(i,1,c.size())
{
res += abso(c[i]-c[i-1]);
}
res += abso(c[0]-c[c.size()-1]);
return res;
}
long long minimum_walk(std::vector<int> p, int s) // for 1st sub
{
int n = p.size();
vector < vector < int > > cycles;
rep(i,0,n)
{
if(vis[i])
continue;
int cur = i;
int ind = cycles.size();
cycles.push_back(vector < int >());
// cout << "here ";
while(!vis[cur])
{
// cout << cur << " ";
vis[cur] = true;
cycles[ind].push_back(cur);
cur = p[cur];
}
// cout << endl;
}
ll ans = 0;
int last = 0;
rep(i,0,cycles.size())
{
ans += get_cycle_cost(cycles[i]);
if(cycles[i].size() > 1)
last = cycles[i][0];
}
ans += last*2;
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... |