제출 #67556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67556		KieranHorgan	로봇 (IOI13_robots)	C++17	100 / 100	2033 ms	61288 KiB

robots

#pragma GCC optimize("Ofast")
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	vector<pair<int, int>> toys(T);
	for(int i = 0; i < T; i++)
		toys[i] = {W[i], S[i]};
	sort(toys.begin(), toys.end());

	sort(X, X+A);
	sort(Y, Y+B);

	bool imp = 0;
	for(auto p: toys)
		if(p.first >= X[A-1] && p.second >= Y[B-1])
			imp = 1;
	if(imp)
		return -1;

	int lo = (T/(A+B))-1, hi = T;
	if(lo < 0) lo = 0;
	while(lo+1 < hi) {
		int mid = (lo+hi)/2;

		priority_queue<int> remaining;
		int i = 0;
		for(int a = 0; a < A; a++) {
			while(i < T && toys[i].first < X[a]) {
				remaining.push(toys[i++].second);
			}
			int j = mid;
			while(!remaining.empty() && j--) {
				remaining.pop();
			}
		}
		while(i < T) {
			remaining.push(toys[i++].second);
		}
		for(int b = B-1; b >= 0; b--) {
			int j = mid;
			while(!remaining.empty() && j--) {
				if(remaining.top() >= Y[b])
					break;
				remaining.pop();
			}
		}
		if(remaining.empty()) hi = mid;
		else lo = mid;
	}

    return lo+1;
}

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