제출 #302044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302044		TMJN	고대 책들 (IOI17_books)	C++17	12 / 100	2096 ms	688480 KiB

books

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

long long minimum_walk(vector<int>P,int S){
	assert(S==0);
	int N=P.size();
	map<pair<vector<int>,pair<int,int>>,int>mp;
	priority_queue<pair<int,pair<vector<int>,pair<int,int>>>,vector<pair<int,pair<vector<int>,pair<int,int>>>>,greater<pair<int,pair<vector<int>,pair<int,int>>>>>pq;
	pq.push({0,{P,{0,-1}}});
	while(!pq.empty()){
		vector<int>v=pq.top().second.first;
		int pos=pq.top().second.second.first;
		int hold=pq.top().second.second.second;
		int dis=pq.top().first;
		pq.pop();
		if(mp.find({v,{pos,hold}})==mp.end()){
			mp[{v,{pos,hold}}]=dis;
			swap(v[pos],hold);
			pq.push({dis,{v,{pos,hold}}});
			swap(v[pos],hold);
			if(pos){
				pq.push({dis+1,{v,{pos-1,hold}}});	
			}
			if(pos!=N-1){
				pq.push({dis+1,{v,{pos+1,hold}}});
			}
		}
	}
	vector<int>K;
	for(int i=0;i<N;i++){
		K.push_back(i);
	}
	return mp[{K,{0,-1}}];
}

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