제출 #423978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423978		cfalas	고대 책들 (IOI17_books)	C++14	0 / 100	2076 ms	696 KiB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
#define len(x) ((int)x.size())

int t, n;
vi a, b;
int s;

vi p;

set<int> vis;
int d=0;
int dist(int pos, int b, int prev){
	//cout<<d<<endl;
	if(pos<0) return MOD;
	if(pos>=len(p)) return MOD;
	if(d>len(p)*len(p)) return MOD;
	int done=1;
	FOR(i,len(p)) if(p[i]!=i) done = 0;
	//if(done) cout<<"FOUND\n";
	if(done) return abs(pos-s);
	vis.insert(pos);
	d++;
	//FOR(i,d) cout<<" |";
	//cout<<pos<<" "<<b<<" | ";
	//FOA(v,p) cout<<v<<" ";
	//cout<<endl;

	int ans=MOD;
	// switch
	if(pos==b || (b==-1 && p[pos]!=pos)){
		int t=p[pos];
		p[pos] = b;
		ans = min(ans, dist(pos, t, pos));
		p[pos] = t;
	}
	if(pos+1!=prev){
		ans = min(ans, 1+dist(pos+1, b, pos));
	}
	if(pos-1!=prev){
		ans = min(ans, 1+dist(pos-1, b, pos));
	}
	vis.erase(pos);
	d--;
	return ans;
}

long long minimum_walk(std::vector<int> pp, int ss) {
	s = ss;
	p = pp;
	return dist(s,-1, -1);
}

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