Submission #1048269

#TimeUsernameProblemLanguageResultExecution timeMemory
1048269LittleOrangeAncient Books (IOI17_books)C++17
0 / 100
0 ms432 KiB
#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);
			}
		}
	}
	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...