Submission #120463

#	Time	Username	Problem	Language	Result	Execution time	Memory
120463		tinjyu	Ancient Books (IOI17_books)	C++14	22 / 100	2045 ms	15992 KiB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
bool tag[1000005];
int a[1000005];
long long int ans;
long long minimum_walk(std::vector<int> p, int s) {
	long long int n=p.size(),ans=0;
	int l=n+1,r=-1;
	int c=0;
	for(int i=0;i<n;i++)
	{
		ans+=abs(i-p[i]);
		if(i<p[i])
		{
			c=1;
			for(int j=i;j<p[i];j++)tag[j]=1;
			l=min(i,l);
			r=max(p[i]-1,r);
		}
		if(i>p[i])
		{
			c=1;
			for(int j=p[i];j<i;j++)tag[j]=1;
			l=min(p[i],l);
			r=max(i-1,r);
		}
	}
	for(int i=min(s,l);i<=max(s,r);i++)
	{
		if(tag[i]==0)ans+=2;
	}
	if(c==0)ans-=2;
	return ans;
}

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