Submission #1233077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233077		candi_ositos	Ancient Books (IOI17_books)	C++20	0 / 100	0 ms	328 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
long long int r;
vector <int> b;
vector <pair <int, int> > d;
int l;
int N;
void mw(int i, int j, int k)
{
    int aux=i-b[i];
    if(aux<0){
        aux*=-1;
    }
    d[k].first+=aux;
    if(i<d[k].second || d[k].second==-1){
        d[k].second=i;
    }
    if(b[i]!=j){
        mw(b[i], j, k);
    }
    b[i]=i;
    return;
}
long long int minimum_walk(vector <int> p, int s){
    N=p.size();
    d.assign(N, pair <int, int>(make_pair(0, -1)));
    b.resize(N);
    l=s;
    for(int i=0; i<N; ++i){
        b[i]=p[i];
    }
    int j=0;
    for(int i=0; i<N; ++i){
        if(b[i]!=i){
            mw(i, i, j);
            ++j;
        }
    }
    r=2*d[j-1].second;
    for(int k=0; k<j; ++k){
        r+=d[k].first;
    }
    return r;
}

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