제출 #479786

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
479786		arujbansal	로봇 (IOI13_robots)	C++17	0 / 100	1 ms	300 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"

using namespace std;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	sort(W, W + T);
	sort(S, S + T, greater<>());

	vector<pair<int, int>> toys(T);
	for (int i = 0; i < T; i++)
		toys[i] = make_pair(W[i], S[i]);

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

	int low = 0, high = T, ans = T + 5;
	while (low <= high) {
		int allowed = low + (high - low) / 2;

		priority_queue<int> pq;

		for (int i = 0, j = 0, can_pick = 0; i < A; i++, can_pick += allowed) {
			while (j < T && toys[j].first < X[i])
				pq.push(toys[j++].second);

			while (!pq.empty() && can_pick > 0) {
				pq.pop();
				can_pick--;

			}
		}

		for (int i = 0, can_pick = 0; i < B; i++, can_pick += allowed) {
			while (!pq.empty() && pq.top() < Y[i] && can_pick > 0) {
				pq.pop();
				can_pick--;
			}
		}

		if (pq.empty()) {
			high = allowed - 1;
			ans = allowed;
		} else low = allowed + 1;

	}

	return (ans < T + 5 ? ans : -1);
}

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