oj.uz

Submission #7025

# Submission time Handle Problem Language Result Execution time Memory
7025 2014-07-12T14:40:31 Z gs13068 Robots (IOI13_robots) C++
90 / 100
 516 ms 21668 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;
            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;
}

Subtask #1
14.0 / 14.0

# 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 4 ms 18592 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 312 ms 18592 KB Output is correct
5 Correct 228 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 316 ms 18592 KB Output is correct
9 Correct 304 ms 18592 KB Output is correct

Subtask #3
25.0 / 25.0

# 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 0 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 0 ms 18592 KB Output is correct
11 Correct 0 ms 18592 KB Output is correct
12 Correct 0 ms 18592 KB Output is correct
13 Correct 4 ms 18592 KB Output is correct
14 Correct 0 ms 18592 KB Output is correct

Subtask #4
37.0 / 37.0

# 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 4 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 0 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 0 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 0 ms 18592 KB Output is correct
16 Correct 8 ms 18592 KB Output is correct
17 Correct 12 ms 18592 KB Output is correct
18 Correct 8 ms 18592 KB Output is correct

Subtask #5
0.0 / 10.0

# 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 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 324 ms 18592 KB Output is correct
11 Correct 228 ms 18592 KB Output is correct
12 Correct 40 ms 18592 KB Output is correct
13 Correct 284 ms 18592 KB Output is correct
14 Correct 304 ms 18592 KB Output is correct
15 Correct 0 ms 18592 KB Output is correct
16 Correct 4 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 0 ms 18592 KB Output is correct
20 Correct 4 ms 18592 KB Output is correct
21 Correct 16 ms 18592 KB Output is correct
22 Incorrect 516 ms 21668 KB Output isn't correct
23 Halted 0 ms 0 KB -