Submission #7026

# Submission time Handle Problem Language Result Execution time Memory
7026 2014-07-12T14:41:06 Z gs13068 Robots (IOI13_robots) C++
100 / 100
1884 ms 22552 KB
#include "robots.h"
#include<algorithm>
#include<set>
#include<vector>

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

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;
		for(i=0;i<T;i++)V[i]=0;
		for(i=0;i<B;i++)E[i].clear();
		for(i=0;i<T;i++)
		{
			j=std::lower_bound(Y,Y+B,D[i].second)-Y;
			if(j<B)E[j].push_back(i);
		}
		j=0;
        for(i=B-1;i>=0;i--)
		{
			j+=mid;
			if(j>2e9)j=2e9;
            while(j>0&&E[i].size())
			{
				V[E[i][E[i].size()-1]]=1;
				E[i].pop_back();
				j--;
			}
		}
		for(i=0;i<A;i++)R[i]=0;
		j=0;
		for(i=0;i<T;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;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 18592 KB Output is correct
2 Correct 0 ms 18592 KB Output is correct
3 Correct 4 ms 18592 KB Output is correct
4 Correct 0 ms 18592 KB Output is correct
5 Correct 0 ms 18592 KB Output is correct
6 Correct 0 ms 18592 KB Output is correct
7 Correct 4 ms 18592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 18592 KB Output is correct
2 Correct 0 ms 18592 KB Output is correct
3 Correct 0 ms 18592 KB Output is correct
4 Correct 332 ms 18592 KB Output is correct
5 Correct 244 ms 18592 KB Output is correct
6 Correct 36 ms 18592 KB Output is correct
7 Correct 300 ms 18592 KB Output is correct
8 Correct 304 ms 18592 KB Output is correct
9 Correct 296 ms 18592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 18592 KB Output is correct
2 Correct 0 ms 18592 KB Output is correct
3 Correct 0 ms 18592 KB Output is correct
4 Correct 0 ms 18592 KB Output is correct
5 Correct 4 ms 18592 KB Output is correct
6 Correct 4 ms 18592 KB Output is correct
7 Correct 4 ms 18592 KB Output is correct
8 Correct 0 ms 18592 KB Output is correct
9 Correct 0 ms 18592 KB Output is correct
10 Correct 4 ms 18592 KB Output is correct
11 Correct 0 ms 18592 KB Output is correct
12 Correct 4 ms 18592 KB Output is correct
13 Correct 0 ms 18592 KB Output is correct
14 Correct 0 ms 18592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 18592 KB Output is correct
2 Correct 0 ms 18592 KB Output is correct
3 Correct 0 ms 18592 KB Output is correct
4 Correct 0 ms 18592 KB Output is correct
5 Correct 0 ms 18592 KB Output is correct
6 Correct 0 ms 18592 KB Output is correct
7 Correct 0 ms 18592 KB Output is correct
8 Correct 4 ms 18592 KB Output is correct
9 Correct 4 ms 18592 KB Output is correct
10 Correct 0 ms 18592 KB Output is correct
11 Correct 0 ms 18592 KB Output is correct
12 Correct 4 ms 18592 KB Output is correct
13 Correct 0 ms 18592 KB Output is correct
14 Correct 0 ms 18592 KB Output is correct
15 Correct 4 ms 18592 KB Output is correct
16 Correct 12 ms 18592 KB Output is correct
17 Correct 16 ms 18592 KB Output is correct
18 Correct 8 ms 18592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 18592 KB Output is correct
2 Correct 4 ms 18592 KB Output is correct
3 Correct 0 ms 18592 KB Output is correct
4 Correct 0 ms 18592 KB Output is correct
5 Correct 4 ms 18592 KB Output is correct
6 Correct 4 ms 18592 KB Output is correct
7 Correct 0 ms 18592 KB Output is correct
8 Correct 0 ms 18592 KB Output is correct
9 Correct 0 ms 18592 KB Output is correct
10 Correct 328 ms 18592 KB Output is correct
11 Correct 236 ms 18592 KB Output is correct
12 Correct 44 ms 18592 KB Output is correct
13 Correct 300 ms 18592 KB Output is correct
14 Correct 312 ms 18592 KB Output is correct
15 Correct 0 ms 18592 KB Output is correct
16 Correct 0 ms 18592 KB Output is correct
17 Correct 0 ms 18592 KB Output is correct
18 Correct 0 ms 18592 KB Output is correct
19 Correct 4 ms 18592 KB Output is correct
20 Correct 0 ms 18592 KB Output is correct
21 Correct 16 ms 18592 KB Output is correct
22 Correct 512 ms 21668 KB Output is correct
23 Correct 288 ms 18592 KB Output is correct
24 Correct 1072 ms 20308 KB Output is correct
25 Correct 1592 ms 22532 KB Output is correct
26 Correct 692 ms 21668 KB Output is correct
27 Correct 1884 ms 22552 KB Output is correct
28 Correct 1824 ms 22024 KB Output is correct
29 Correct 544 ms 21668 KB Output is correct