Submission #7017

#	Time	Username	Problem	Language	Result	Execution time	Memory
7017		gs13068	로봇 (IOI13_robots)	C++98	0 / 100	1584 ms	19668 KiB

robots

#include "robots.h"
#include<algorithm>
#include<set>

int V[1000000];
std::pair<int,int> D[1000000];
int R[50000];
std::set<std::pair<int,int> > E;
std::set<std::pair<int,int> >::iterator it;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
	int i,j,l,r,mid;
	for(i=0;i<T;i++)
	{
		D[i].first=S[i]+1;
		D[i].second=W[i]+1;
	}
	std::sort(X,X+A);
	std::sort(Y,Y+B);
	std::sort(D,D+T);
	for(i=0;i<T;i++)if(D[i].first>Y[B-1]&&D[i].second>X[A-1])return -1;
	l=1;r=T;
	while(l<r)
	{
		mid=(l+r)/2;
		E.clear();
		for(i=0;i<T;i++)V[i]=0;
		for(i=0;i<A;i++)
		{
			R[i]=0;
			E.insert(std::make_pair(X[i],i));
		}
		for(i=T-1;i>=0;i--)if(!E.empty()&&E.rbegin()->first>=D[i].second)
		{
			V[i]=1;
			it=E.lower_bound(std::make_pair(D[i].second,-1));
			R[it->second]++;
			if(R[it->second]==mid)E.erase(it);
		}
		for(i=0;i<B;i++)R[i]=0;
		j=0;
		for(i=0;i<T&&j<B;i++)if(!V[i])
		{
			while(j<B&&(Y[j]<D[i].second||R[j]==mid))j++;
			if(j<B)
			{
				V[i]=1;
				R[j]++;
			}

		}
		for(i=0;i<T;i++)if(!V[i])break;
		if(i==T)r=mid;
		else l=mid+1;
	}
	return r;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37
• Subtask 5: 0 / 10