제출 #373627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
373627		cheissmart	로봇 (IOI13_robots)	C++14	76 / 100	250 ms	17260 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define V vector
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "LINE(" << __LINE__ << ") -> " << #x << " is " << (x) << endl

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	vi a(A), b(B);
	V<pi> c(T);
	for(int i = 0; i < A; i++) a[i] = X[i];
	for(int i = 0; i < B; i++) b[i] = Y[i];
	for(int i = 0; i < T; i++) c[i] = MP(W[i], S[i]);
	sort(ALL(a)), sort(ALL(b)), sort(ALL(c), [&] (pi a, pi b) {
		return a.S < b.S;
	});
	auto noB = [&] () {
		sort(W, W + T);
		int mx = 0;
		for(int i = T - 1, j = A - 1; i >= 0; i--) {
			while(j >= 0 && a[j] > W[i]) j--;
			int have = T - i, can = A - 1 - j;
			mx = max(mx, (have + can - 1) / can);
		}
		return mx;
	};
	if(B == 0) return noB();
	auto ok = [&] (int k) { // each people can kill at msot k things
		set<pi> ms, ms2;
		for(int i = A - 1; i >= 0; i--) ms.insert({a[i], i});
		for(int i = B - 1; i >= 0; i--) ms2.insert({b[i], i});
		vi cnt(A), cnt2(B);
		for(int i = T - 1; i >= 0; i--) {
			int x = c[i].F, y = c[i].S;
			if(ms.size() && ms.upper_bound(MP(x, INF)) != ms.end()) {
				auto it = ms.upper_bound(MP(x, INF));
				cnt[it -> S]++;
				if(cnt[it -> S] == k) ms.erase(it);
			} else {
				if(ms2.empty() || ms2.upper_bound(MP(y, INF)) == ms2.end())
					return false;
				auto it = ms2.upper_bound(MP(y, INF));
				cnt2[it -> S]++;
				if(cnt2[it -> S] == k) ms2.erase(it);
			}
		}
		return true;
	};

	int lb = 1, rb = T;
	while(lb <= rb) {
		int mb = (lb + rb) / 2;
		if(ok(mb)) rb = mb - 1;
		else lb = mb + 1;
	}
	if(lb > T) return -1;
	return lb;
}

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