Submission #70341

#	Time	Username	Problem	Language	Result	Execution time	Memory
70341		gnoor	Ancient Books (IOI17_books)	C++17	0 / 100	3 ms	392 KiB

books

#include "books.h"

#include <vector>
#include <algorithm>

using namespace std;

bool visit[1000100];

long long minimum_walk(vector<int> p, int s) {
	int n=(int)p.size();
	vector<pair<int,int>> coord;
	long long ans=0;
	for (int i=0;i<n;i++) {
		if (visit[i]) continue;
		visit[i]=true;
		int mn=i;
		int mx=i;
		int cur=p[i];
		while (cur!=i) {
			visit[cur]=true;
			mx=max(mx,cur);
			mn=min(mn,cur);
			cur=p[cur];
		}
		ans+=(mx-mn)*2;
		coord.push_back({mn,mx});
	}
	sort(coord.begin(),coord.end(),[](const pair<int,int> &a,const pair<int,int> &b) {
			if (a.second!=b.second) return a.second<b.second;
			return a.first<b.first;
			});
	int r=coord[0].second;
	for (int i=1;i<(int)coord.size();i++) {
		if (coord[i].first>r) {
			ans+=(coord[i].first-r)*2;
		}
		r=coord[i].second;
	}
	return ans;
}

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