제출 #1083170

#제출 시각아이디문제언어결과실행 시간메모리
1083170Math4Life2020고대 책들 (IOI17_books)C++17
0 / 100
2045 ms604 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long; using pii = pair<ll,ll>;

ll minimum_walk(vector<int> p, int s) {
	ll N = sizeof(p);
	assert(s==0);
	ll ans = 0;
	bool found[N];
	for (ll i=0;i<N;i++) {
		found[i]=0;
	}
	ll D = 0;
	for (ll i=0;i<N;i++) {
		if (!found[i]) {
			ll j = i;
			ll dmin = 1e8;
			do {
				found[j]=1;
				dmin = min(dmin,j);
				ans += abs(p[j]-j);
				j = p[j];
			} while (j != i);
			D = max(D,dmin);
		}
	}
	ans -= 2*D;
	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...