Submission #1083189

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

books

#include <bits/stdc++.h>
using namespace std;

using ll = long long; using pii = pair<ll,ll>;
const ll INF = 1e8;

ll minimum_walk(vector<int> p, int s) {
	ll N = p.size();
	ll flux[N];
	for (ll i=0;i<N;i++) {
		flux[i]=0;
	}
	for (ll i=0;i<N;i++) {
		if (p[i]>i) {
			flux[i]++;
			flux[p[i]]--;
		}
	}
	ll pf[N+1];
	pf[0]=0;
	for (ll i=0;i<N;i++) {
		pf[i+1]=pf[i]+flux[i];
	}
	ll maxl[N+1]; ll minl[N+1];
	for (ll i=0;i<=N;i++) {
		maxl[i]=-INF;
		minl[i]=INF;
	}
	for (ll i=1;i<=N;i++) {
		maxl[pf[i]]=max(maxl[pf[i]],i);
		minl[pf[i]]=min(minl[pf[i]],i-1);
	}
	ll xc = s;
	ll ans = 0;
	for (ll i=1;i<=N;i++) {
		if (minl[i]!=INF) {
			ans += abs(xc-minl[i]);
			xc = minl[i];
			ans += abs(xc-maxl[i]);
			xc = maxl[i];
		}
	}
	ans += abs(xc-s);
	return ans;
}

/*int main() {
	vector<int> p1 = {1,0,3,2};
	cout << minimum_walk(p1,0);
}*/

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