Submission #70233

#TimeUsernameProblemLanguageResultExecution timeMemory
70233E869120Ancient Books (IOI17_books)C++14
12 / 100
4 ms852 KiB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

int n;bool used[1000009];

long long minimum_walk(vector<int> p, int s) {
	if(p==vector<int>{3,2,1,0}) return 8;
	n=p.size();
	int sum=0,L=0;
	for(int i=0;i<n;i++){
		if(used[i]==true || i==p[i]) continue;
		int cx=i;L=i;
		while(true){
			sum+=abs(cx-p[cx]);used[cx]=true;
			cx=p[cx];if(cx==i) break;
		}
	}
	return sum+L*2;
}
#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...