Submission #757241

#	Time	Username	Problem	Language	Result	Execution time	Memory
757241		alexander707070	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	340 KiB

books

#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;
 
int n,perm[MAXN],len[MAXN],br,cnt,last;
bool li[MAXN];
long long sum,add[MAXN],ans;

void dfs(int x){
	li[x]=true;
	sum+=abs(x-perm[x]); br++;
	if(!li[perm[x]])dfs(perm[x]);
}

long long minimum_walk(vector<int> p, int s){
	n=int(p.size());

	for(int i=0;i<n;i++)perm[i]=p[i];

	for(int i=0;i<n;i++){
		if(!li[i]){
			sum=br=0; 
			dfs(i); add[i]=sum; len[i]=br;
			if(len[i]>1)last=i;
		}
	}


	cnt=n;
	for(int i=0;i<=last;i++){
		ans+=add[i]; cnt-=len[i];
		
		if(cnt==0){
			ans+=i; break;
		}
		ans++;
	}

	return ans;
}

/*
int main(){
	cout<<minimum_walk({0, 2, 3, 1}, 0)<<"\n";
}
*/

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