Submission #1073844

#TimeUsernameProblemLanguageResultExecution timeMemory
1073844ArthuroWichAncient Books (IOI17_books)C++17
12 / 100
1 ms348 KiB
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> p, int s) {
	int ans = 0, n = p.size();
	for (int i = 0; i < n; i++) {
		ans += abs(i-p[i]);
	}
	vector<pair<int, int>> cycles;
	for (int i = 0; i < n; i++) {
		if (p[i] == i) {
			continue;
		}
		int a = i, l = i, r = i;
		a = p[i];
		l = min(l, a);
		r = max(r, a);
		while(a != i) {
			a = p[a];
			l = min(l, a);
			r = min(r, a);
		}
		cycles.push_back({l, r});
	}
	vector<int> pref(n+1, 0);
	for (auto [i, j] : cycles) {
		pref[i] += 1;
		pref[j+1] -= 1; 
	}
	for (int i = 1; i < n; i++) {
		pref[i] += pref[i-1];
	}
	bool f = 0;
	for (int i = n-1; i >= 0; i--) {
		if (pref[i] > 0) {
			f = 1;
		}
		if (f && pref[i] == 0) {
			ans += 2;
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...