oj.uz

Submission #7021

# Submission time Handle Problem Language Result Execution time Memory
7021 2014-07-12T14:30:33 Z gs13068 Robots (IOI13_robots) C++
14 / 100
 300 ms 17424 KB 
#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=W[i]+1;
		D[i].second=S[i]+1;
	}
	std::sort(X,X+A);
	std::sort(Y,Y+B);
	std::sort(D,D+T);
	for(i=0;i<T;i++)if((!A||D[i].first>X[A-1])&&(!B||D[i].second>Y[B-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<B;i++)
		{
			R[i]=0;
			E.insert(std::make_pair(Y[i],i));
		}
		for(i=T-1;i>=0;i--)
		{
			it=E.lower_bound(std::make_pair(D[i].second,-1));
			if(it!=E.end())
			{
				V[i]=1;
				R[it->second]++;
				if(R[it->second]==mid)E.erase(it);
			}
		}
		for(i=0;i<A;i++)R[i]=0;
		j=0;
		for(i=0;i<T&&j<A;i++)if(!V[i])
		{
			while(j<A&&(X[j]<D[i].first||R[j]==mid))j++;
			if(j<A)
			{
				V[i]=1;
				R[j]++;
			}
			else break;
		}
		if(i==T)r=mid;
		else l=mid+1;
	}
	return r;
}

Subtask #1
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17424 KB Output is correct
2 Correct 0 ms 17424 KB Output is correct
3 Correct 0 ms 17424 KB Output is correct
4 Correct 0 ms 17424 KB Output is correct
5 Incorrect 0 ms 17424 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17424 KB Output is correct
2 Correct 0 ms 17424 KB Output is correct
3 Correct 0 ms 17424 KB Output is correct
4 Correct 284 ms 17424 KB Output is correct
5 Correct 220 ms 17424 KB Output is correct
6 Correct 36 ms 17424 KB Output is correct
7 Correct 292 ms 17424 KB Output is correct
8 Correct 300 ms 17424 KB Output is correct
9 Correct 276 ms 17424 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17424 KB Output is correct
2 Correct 4 ms 17424 KB Output is correct
3 Correct 0 ms 17424 KB Output is correct
4 Correct 0 ms 17424 KB Output is correct
5 Correct 0 ms 17424 KB Output is correct
6 Correct 4 ms 17424 KB Output is correct
7 Incorrect 4 ms 17424 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17424 KB Output is correct
2 Correct 0 ms 17424 KB Output is correct
3 Correct 0 ms 17424 KB Output is correct
4 Correct 0 ms 17424 KB Output is correct
5 Correct 0 ms 17424 KB Output is correct
6 Correct 0 ms 17424 KB Output is correct
7 Incorrect 0 ms 17424 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17424 KB Output is correct
2 Correct 0 ms 17424 KB Output is correct
3 Correct 0 ms 17424 KB Output is correct
4 Correct 0 ms 17424 KB Output is correct
5 Correct 0 ms 17424 KB Output is correct
6 Correct 4 ms 17424 KB Output is correct
7 Incorrect 0 ms 17424 KB Output isn't correct
8 Halted 0 ms 0 KB -