Submission #775867

#	Time	Username	Problem	Language	Result	Execution time	Memory
775867		PoonYaPat	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	212 KiB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll ans=0,cnt[1000005];

ll minimum_walk(vector<int> p, int s) {
	int n=p.size();
	for (int i=0; i<n; ++i) {
		++cnt[min(i,p[i])];
		--cnt[max(i,p[i])];
	}
	for (int i=1; i<n; ++i) cnt[i]+=cnt[i-1];

	for (int i=0; i<n-1; ++i) {
		ans+=cnt[i];
		if (cnt[i]==0) ans+=2;
	}
	return ans;
}

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