제출 #299767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299767		errorgorn	고대 책들 (IOI17_books)	C++14	50 / 100	207 ms	24292 KiB

books

#include "books.h"

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

#define ll long long
#define ii pair<int,int>
#define fi first
#define se second

#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

int n;
vector<int> arr;

int fwd[1000005];
vector<int> imp;

long long minimum_walk(std::vector<int> p, int s) {
	n=sz(p);
	arr=p;
	
	rep(x,0,n){
		if (x<arr[x]){
			fwd[x]++,fwd[arr[x]]--;
			imp.push_back(x);
			imp.push_back(arr[x]);
		}
		else if (arr[x]<x){
			imp.push_back(x);
			imp.push_back(arr[x]);
		}
	}
	
	if (imp.empty()) return 0;
	
	rep(x,0,n) fwd[x+1]+=fwd[x];
	
	int l=0,r=n-1;
	while (fwd[l]==0) l++;
	while (fwd[r]==0) r--;
	
	ll ans=1e9;
	for (auto &it:imp) ans=min(ans,(ll)abs(s-it));
	
	rep(x,l,r+1){
		ans+=max(fwd[x],1);
	}
	
	return ans*2;
}

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