Submission #1048301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1048301		LittleOrange	Ancient Books (IOI17_books)	C++17	0 / 100	0 ms	600 KiB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
long long minimum_walk(std::vector<int> p, int s) {
	ll ans = 0;
	ll n = p.size();
	/*
	if (s == 0){
		vector<ll> u(n,0);
		for(ll i = 0;i<n;i++){
			if(p[i]!=i){
				ans += i-s;
				s = i;
				ll x = i;
				do{
					ans += abs(p[x]-x);
					ll y = x;
					x = p[x];
					p[y] = y;
				} while(x!=i);
			}
		}
		ans += s;
	}*/
	ll gpc = 0;
	vector<ll> gp(n,-1);
	vector<vector<ll>> gps;
	for(ll i = 0;i<n;i++){
		if (gp[i]==-1){
			ll cur = gpc++;
			gps.emplace_back();
			ll x = i;
			do{
				gp[x] = cur;
				gps[cur].push_back(x);
				ans += abs(p[x]-x);
				x = p[x];
			} while(x!=i);
		}
	}
	ans += (gpc-1)*2;
	for(ll i = 0;i<n;i++){
		if (p[i]==i&&i<s) ans-=2;
		else break;
	}
	for(ll i = n-1;i>=0;i--){
		if (p[i]==i&&i>s) ans-=2;
		else break;
	}
	return ans;
}

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