Submission #142894

#	Time	Username	Problem	Language	Result	Execution time	Memory
142894		babo	Ancient Books (IOI17_books)	C++14	12 / 100	2 ms	376 KiB

books

#include <bits/stdc++.h>
#define inf 1000000000000000000ll
#define all(x) (x).begin(),(x).end()
#define ab(x) ((x)>0?(x):-(x))
#define L long long

using namespace std;

L n;
L chk[1000010];

struct S{
	L s,e;
};

vector<S>v;
vector<L>w;

L minimum_walk(vector<int>p,int s){
	L i,ret=0,cntgroup=-1,startdist=inf;
	n=p.size();
	for(i=0;i<n;i++)
	{
		if(p[i]==i) p[i]=-1;
	}
	for(i=0;i<n;i++)
	{
		if(p[i]==-1) continue;
		if(!chk[i])
		{
			L s=i,e=i;
			L temp=p[i];
			ret+=ab(p[i]-i);
			chk[temp]=1;
			while(temp!=i)
			{
				e=max(e,temp);
				ret+=ab(p[temp]-temp);
				temp=p[temp];
				chk[temp]=1;
			}
			v.push_back((S){s,e});
		}
	}
	sort(all(v),[](S a,S b){
		return a.s<b.s;
	});
	L emax=-1;
	for(i=0;i<v.size();i++)
	{
		//printf("s e %lld %lld\n",v[i].s,v[i].e);
		if(v[i].s>emax) cntgroup++;
		if(v[i].e>emax)
		{
			w.push_back(v[i].s);
			w.push_back(v[i].e);
			//printf("%lld %lld\n",v[i].s,v[i].e);
		}
		emax=max(emax,v[i].e);
	}



	vector<L>::iterator it=lower_bound(all(w),s+1);
	if(it!=w.end())
		startdist=min(startdist,*it-s);
	                    it=upper_bound(all(w),s);
	if(it!=w.begin())
		startdist=min(startdist,s-(*prev(it)));
	if(startdist==inf) return 0;

	//printf("%lld %lld %lld\n",ret,cntgroup,startdist);
	return ret+cntgroup*2+startdist*2;
}

Compilation message (stderr)

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:49:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<v.size();i++)
          ~^~~~~~~~~

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