제출 #153279

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
153279		mieszko11b	고대 책들 (IOI17_books)	C++14	100 / 100	405 ms	178108 KiB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ii = pair<int, int>;

#define X first
#define Y second

int n;
bool vis[1000007];
ii I[1000007];
int minv[21][1000007], maxv[21][1000007];
int maxk[1000007];

int getmin(int a, int b) {
	int l = (b - a + 1);
	return min(minv[maxk[l]][a], minv[maxk[l]][b - (1 << maxk[l]) + 1]);
}

int getmax(int a, int b) {
	int l = (b - a + 1);
	return max(maxv[maxk[l]][a], maxv[maxk[l]][b - (1 << maxk[l]) + 1]);
}

ii extend(int a, int b) {
	int na = min(a, getmin(a, b));
	int nb = max(b, getmax(a, b));
	if((ii){na, nb} == (ii){a, b})
		return {a, b};
	return extend(na, nb);
}

int dist_left(int x, int y) {
	int res = 0;
	int a = x, b = x;
	while(a > y) {
		res++;
		a--;
		a = extend(a, b).X;
	}
	return res;
}

int dist_right(int x, int y) {
	int res = 0;
	int a = x, b = x;
	while(b < y) {
		res++;
		b++;
		b = extend(a, b).Y;
	}
	return res;
}

long long minimum_walk(std::vector<int> p, int s) {
	ll res = 0;
	n = p.size();

	for(int i = 0 ; i < n ; i++) {
		if(vis[i])
			continue;
	
		vector<int> tmp;
		int minx = 1e9, maxx = -1;
		
		int w = i;
		while(!vis[w]) {
			vis[w] = 1;
			res += abs(p[w] - w);
			minx = min(minx, w);
			maxx = max(maxx, w);
			tmp.push_back(w);
			w = p[w];
		}
		
		for(int x : tmp)
			I[x] = {minx, maxx};
	}

	for(int i = 0 ; i < n ; i++)
		minv[0][i] = maxv[0][i] = p[i];
		
	for(int k = 1 ; k < 20 ; k++) {
		for(int i = 0 ; i + (1 << k) <= n ; i++) {
			minv[k][i] = min(minv[k - 1][i], minv[k - 1][i + (1 << (k - 1))]);
			maxv[k][i] = max(maxv[k - 1][i], maxv[k - 1][i + (1 << (k - 1))]);
		}
	}
	
	int k = 0;
	for(int i = 1 ; i <= n ; i++) {
		if((1 << (k + 1)) <= i)
			k++;
		maxk[i] = k;
	}
	
	int begin = 0;
	while(begin < n && p[begin] == begin)
		begin++;
		
	if(begin == n)
		return 0;
		
	int end = n - 1;
	while(p[end] == end)
		end--;
	
	end = max(end, s);
	begin = min(begin, s);
	
	int a = extend(s, s).X, b = extend(s, s).Y;
	
	while(a > begin || b < end) {
		int lbook = a - 1;
		while(lbook >= 0 && I[lbook].Y < s)
			lbook--;

		if(lbook == -1) {
			res += 2 * dist_left(a, begin);
			res += 2 * dist_right(b, end);
			a = begin;
			b = end;
			continue;
		}
		
		int rbook = b + 1;
		while(I[rbook].X > s)
			rbook++;
			
		if(dist_left(a, lbook) < dist_right(b, rbook)) {
			res += 2 * dist_left(a, lbook);
		} else {
			res += 2 * dist_right(b, rbook);
		}
		
		ii r = extend(lbook, rbook);
		a = r.X;
		b = r.Y;
	}

	//~ for(int i = 0 ; i < n ; i++)
		//~ cout << I[i].X << " " << I[i].Y << endl;

	return res;
}

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