Submission #1083174

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083174		Math4Life2020	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	348 KiB

books

#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 = p.size();
	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;
}

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