# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425501 | Charis02 | Ancient Books (IOI17_books) | C++14 | 2080 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"
#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();
int misplaced = 0;
int cur = 0;
int holding = -1;
rep(i,0,n)
{
if(p[i] != i)
misplaced++;
}
ll ans = -1;
bool dpos = true;
while(true)
{
ans++;
if(p[cur] != cur)
{
int tmp = holding;
holding = p[cur];
p[cur] = tmp;
if(p[cur] == cur)
misplaced--;
}
if(misplaced == 0)
break;
if(dpos && cur == n-1)
dpos = false;
if(!dpos && cur == 0)
dpos = true;
if(dpos)
cur++;
else
cur--;
}
ans += cur;
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... |