Submission #429169

#	Time	Username	Problem	Language	Result	Execution time	Memory
429169		vanic	Ancient Books (IOI17_books)	C++14	12 / 100	279 ms	332 KiB

books

#include "books.h"
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;

const int inf=100;

int n;
const int cap=10;

int rek(int x, int d, int t, vector < int > l){
	if(d>cap || x>=n || x<0){
		return inf;
	}
	if(!x){
		bool p=1;
		if(l[0]!=0 && t){
			p=0;
		}
		for(int i=1; i<n; i++){
			if(l[i]!=i){
				p=0;
				break;
			}
		}
		if(p){
			return d;
		}
	}
	int mini=inf;
	mini=min(mini, rek(x+1, d+1, t, l));
	mini=min(mini, rek(x-1, d+1, t, l));
	swap(l[x], t);
	mini=min(mini, rek(x+1, d+1, t, l));
	mini=min(mini, rek(x-1, d+1, t, l));
	return mini;
}


ll minimum_walk(vector < int > p, int s) {
	n=p.size();
	return rek(0, 0, -1, p);
}

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