제출 #351278

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
351278		Mefarnis	로봇 (IOI13_robots)	C++14	100 / 100	1836 ms	29140 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"
#define maxn 1050000
#define pb push_back
using namespace std;

struct item {
	int w,s,type;
	item(int _w , int _s , int _type) {
		w = _w;
		s = _s;
		type = _type;
	}
};

bool comp(const item& a , const item& b) {
	if(a.w != b.w)
		return a.w < b.w;
	return a.type > b.type;
}

int N,n,a,b;
vector<int> y;
vector<item> ar;

bool check(int d) {
	priority_queue<int> heap;
	for( int i = 0 ; i < N ; i++ ) {
		if(ar[i].type == 0)
			heap.push(ar[i].s);
		else {
			int cnt = d;
			while(cnt > 0 && !heap.empty()) {
				cnt--;
				heap.pop();
			}
		}
	}
	vector<int> v;
	while(!heap.empty()) {
		v.pb(heap.top());
		heap.pop();
	}
	reverse(v.begin(),v.end());
	int idx = 0 , vs = v.size();
	for( int i = 0 ; i < b ; i++ ) {
		int cnt = d;
		while(cnt > 0 && idx < vs && v[idx] < y[i]) {
			cnt--;
			idx++;
		}
	}
	return (idx == vs);
}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	a = A;
	b = B;
	n = T;
	N = n+a;
	for( int i = 0 ; i < b ; i++ )
		y.pb(Y[i]);
	sort(y.begin(),y.end());
	for( int i = 0 ; i < n ; i++ )
		ar.pb(item(W[i],S[i],0));
	for( int i = 0 ; i < a ; i++ )
		ar.pb(item(X[i],-1,1));
	sort(ar.begin(),ar.end(),comp);
	int l = 1 , r = n , ans = -1;
	while(l <= r) {
		int mid = (l+r)>>1;
		if(check(mid))
			ans = mid , r = mid-1;
		else
			l = mid+1;
	}
	return ans;
}

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