Submission #43779

#	Time	Username	Problem	Language	Result	Execution time	Memory
43779		tmwilliamlin168	Robots (IOI13_robots)	C++11	100 / 100	2056 ms	65536 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"
using namespace std;

#define fi first
#define se second

const int mxN1=5e4, mxN2=1e6;
int a, b, t, x[mxN1], y[mxN1];
pair<int, int> ty[mxN2];
priority_queue<int> pq;

inline bool can(int m) {
	pq = priority_queue<int>();
	for(int i1=0, i2=0; i1<a; ++i1) {
		for(; i2<t&&ty[i2].fi<x[i1]; pq.push(ty[i2++].se));
		for(int j=0; j<m&&!pq.empty(); pq.pop(), ++j);
	}
	for(int i=t-1; i>=0&&ty[i].fi>=(a?x[a-1]:0); pq.push(ty[i--].se));
	for(int i1=b-1; i1>=0&&!(!pq.empty()&&pq.top()>=y[i1]); --i1)
		for(int j=0; j<m&&!pq.empty(); pq.pop(), ++j);
	return pq.empty();
}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	a=A, b=B, t=T;
	memcpy(x, X, 4*a);
	sort(x, x+a);
	memcpy(y, Y, 4*b);
	sort(y, y+b);
	for(int i=0; i<t; ++i)
		ty[i]={W[i], S[i]};
	sort(ty, ty+t);
	int l=1, r=t+1;
	while(l<=r) {
		int m=(l+r)/2;
		if(can(m))
			r=m-1;
		else
			l=m+1;
	}
    return l>t?-1:l;
}

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