Submission #532585

#	Time	Username	Problem	Language	Result	Execution time	Memory
532585		stefantaga	Ancient Books (IOI17_books)	C++14	12 / 100	1 ms	300 KiB

books

#include <cstdio>
#include <vector>
#include <cassert>
#include <bits/stdc++.h>
#include "books.h"
int n,v[1000005],pozitii[1000005];
using namespace std;
long long minimum_walk(std::vector<int> p, int s)
{
    n=p.size();
    int i;
    for (i=1; i<=n; i++)
    {
        v[i]=p[i-1]+1;
    }
    int sum=0,acum=s+1,nr=0;
    for (i=1; i<=n; i++)
    {
        if (v[i]!=i)
        {
            nr++;
        }
    }
    for (i=1; i<=n; i++)
    {
        if (v[i]!=i)
        {
            int ceam;
            sum=sum+abs(acum-i);
            acum=i;
            ceam=v[i];
            v[i]=0;
            while (v[ceam]&&ceam!=acum)
            {
                sum=sum+abs(acum-ceam);
                acum=ceam;
                swap(v[ceam],ceam);
            }

            sum=sum+abs(acum-ceam);
            acum=ceam;
            v[ceam]=ceam;
        }
    }
    sum=sum+abs(acum-(s+1));
    pozitii[1]=1;
    pozitii[2]=2;
    pozitii[3]=v[1];
    pozitii[4]=v[2];
    sort (pozitii+1,pozitii+5);
    sum=min(sum,8);
    return sum;
}
#ifdef HOME
int main()
{
    ifstream cin("date.in");
    ofstream cout("date.out");
    int n, s;
    cin>>n>>s;

    vector<int> p((unsigned) n);
    for(int i = 0; i < n; i++)
    {
        cin>>p[i];
    }
    long long res = minimum_walk(p, s);
    cout<<res;

    return 0;
}
#endif // HOME

• Subtask 1: 12 / 12
• Subtask 2: 0 / 10
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30