Submission #292945

#	Time	Username	Problem	Language	Result	Execution time	Memory
292945		amoo_safar	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	384 KiB

books

#include "books.h"

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

const int N = 1e6 + 10;

int mk[N];

ll minimum_walk(vector<int> p, int s) {
	int n = p.size();
	ll ans = 0;
	ll near = n;
	for(int i = 0; i < n; i++){
		if(p[i] != i){
			ans += abs(p[i] - i);
			near = min(near, (ll) abs(s - i));
		} else mk[i] = 1;
	}
	int com = 0;
	vector<pii> seg;
	for(int i = 0; i < n; i++){
		if(mk[i]) continue;
		com ++;
		vector<int> vis;
		int nw = i;
		while(!mk[nw]){
			mk[nw] = 1;
			vis.pb(nw);
			nw = p[nw];
		}
		sort(all(vis));
		seg.pb({vis[0], vis.back()});
	}
	if(com == 0) return 0;
	sort(all(seg));
	int mxr = seg[0].F;
	for(int i = 1; i < (int)seg.size(); i++){
		if(mxr < seg[i].F)
			ans += 2 * (seg[i].F - mxr);
		mxr = max(mxr, seg[i].S);
	}
	ans += 2 * near;
	return ans;
}

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