Submission #132308

#	Time	Username	Problem	Language	Result	Execution time	Memory
132308		MoNsTeR_CuBe	Ancient Books (IOI17_books)	C++17	0 / 100	2041 ms	376 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;

long long minimum_walk(std::vector<int> p, int s) {
	#define int long long 
	
	vector< pair<int, int> > v;
	
	for(int i = 0; i < (int)p.size(); i++){
		v.push_back(make_pair(p[i], i));
	}
	
	sort(p.begin(), p.end());
	
	int mini = numeric_limits<int>::max();
	
	do{
		int last = s;
	
		int tot = 0;
		
		for(int i = 0; i < (int)v.size(); i++){
			tot += abs(last - v[i].second);
			tot += abs(v[i].first-v[i].second);
			
			last = v[i].first;
		}
		
		tot += abs(last - s);
		
		mini = min(mini, tot);
	}while(next_permutation(p.begin(), p.end()));
	
	return mini;
	
	#undef int
}

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