제출 #94353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94353		fjzzq2002	로봇 (IOI13_robots)	C++14	100 / 100	2290 ms	63832 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef pair<int,int> pii;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	vector<int> x,y;
	for(int i=0;i<A;++i) x.pb(X[i]);
	for(int i=0;i<B;++i) y.pb(Y[i]);
	sort(x.begin(),x.end());
	sort(y.begin(),y.end());
	multiset<pii> a,b;
	for(int i=0;i<T;++i)
	{
		int p=x.end()-upper_bound(x.begin(),
		x.end(),W[i]),
		q=y.end()-upper_bound(y.begin(),
		y.end(),S[i]);
		if(p==0&&q==0) return -1;
		a.insert(pii(p,q));
		b.insert(pii(q,p));
	}
	int cn=0;
	while(a.size())
	{
		++cn;
		for(int i=1;i<=A;++i)
		{
			auto g=a.lower_bound(pii(i,-233));
			if(g==a.end()) break;
			pii x=*g; a.erase(g);
			b.erase(b.find(pii(x.se,x.fi)));
		}
		for(int i=1;i<=B;++i)
		{
			auto g=b.lower_bound(pii(i,-233));
			if(g==b.end()) break;
			pii x=*g; b.erase(g);
			a.erase(a.find(pii(x.se,x.fi)));
		}
	}
	return cn;
}

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