제출 #104447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104447		eriksuenderhauf	로봇 (IOI13_robots)	C++11	0 / 100	3 ms	512 KiB

robots

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "robots.h"
//#include "grader.h"
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long int ll;
const double pi = acos(-1);
const int MOD = 1e9 + 9;
const int INF = 1e9 + 7;
const int MAXN = 3e5 + 5;
const double eps = 1e-9;
int x[MAXN], y[MAXN], vis[MAXN];
pii arr[MAXN], narr[MAXN];
int a, b, t;

bool ok(int cnt) {
	memset(vis, 0, sizeof vis);
	sort(arr, arr + t, [](pii lhs, pii rhs) {
		if (lhs.fi == rhs.fi)
			return lhs.se > rhs.se;
		return lhs.fi < rhs.fi;
	});
	int n = 0;
	for (int i = t - 1, it = a-1; it >= 0 && i >= 0; it--) {
		int j = i, cur = 0;
		while (j >= 0 && cur <= cnt) {
			if (x[it] > arr[j].fi)
				cur++, vis[j] = 1;
			else
				narr[n++] = {arr[j].se, j};
			j--;
		}
		i = j;
	}
	sort(narr, narr + n);
	for (int i = n - 1, it = b-1; it >= 0 && i >= 0; it--) {
		int j = i, cur = 0;
		while (j >= 0 && cur <= cnt) {
			if (y[it] > arr[j].fi)
				cur++, vis[arr[j].se] = 1;
			j--;
		}
		i = j;
	}
	for (int i = 0; i < t; i++)
		if (!vis[i])
			return false;
	return true;
}

//w<x;s<y
int putaway(int A, int B, int T, int X[], int Y[], int w[], int s[]) {
	a = A, b = B, t = T;
	int mxX = 0, mxY = 0;
	for (int i = 0; i < a; i++) {
		x[i] = X[i];
		mxX = max(mxX, X[i]);
	}
	sort(x, x + a);
	for (int i = 0; i < b; i++) {
		y[i] = Y[i];
		mxY = max(mxY, Y[i]);
	}
	sort(y, y + b);
	for (int i = 0; i < t; i++) {
		arr[i] = {w[i], s[i]};
		if (w[i] >= mxX || s[i] >= mxY)
			return -1;
	}
	int lo = 1, hi = t, ret = t;
	while (lo <= hi) {
		int mi = (lo + hi) / 2;
		if (ok(mi))
			hi = mi - 1, ret = mi;
		else
			lo = mi + 1;
	}
	return ret;
}

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