Submission #132601

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

books

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

long long minimum_walk(std::vector<int> p, int s) {
	vector< int > v;
	
	for(int i = 0; i < 4; i++){
		v.push_back(i);
	}
	
	map< vector< int >, int> mape;
	int curr = 0;
	
	//int curr[24] = {0,6,4,6,6,6,2,6,4,6,6};
	int ans[24] = {0,6,4,6,6,6,2,6,4,6,6,6,6,4,6,4,6,6,6,6,6,6,6,6};
	do{
		for(int a : v) cout << a << ' ';
		cout << endl;
		mape[v] = ans[curr++];
	}while(next_permutation(v.begin(), v.end()));
	return mape[p];
}

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