제출 #119371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119371		SuperJava	로봇 (IOI13_robots)	C++17	76 / 100	3030 ms	44304 KiB

robots

#include <vector>
#include <utility>
#include <iostream>
#include <tuple>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
typedef long long ll;
using namespace std;
#include "robots.h"

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	vector<pair<int,int>> ok;
	for (int i = 0; i < T; ++i){
		ok.push_back({S[i],W[i]});
	}
	sort(X,X+A);
	reverse(X,X+A);
	sort(Y,Y+B);
	reverse(Y,Y+B);
	int l = (T+A+B-1)/(A+B),r = T,ans = -1;
	vector<pair<int,int>> q;
	for (int i = 0; i < T; ++i){
		q.push_back(ok[i]);
	}
	sort(q.begin(), q.end(),[](auto e,auto z){
		if(e.first == z.first) return e.second > z.second;
		return e.first < z.first;
	});
	while(l <= r){
		int mid = (l+r)/2;
		bool good = true;
		multiset<int> ava;
		vector<int> ad;
		// (S W) (Y X) 
		int mx1 = min(ll(T),ll(A)*ll(mid));
		int mx2 = min(ll(T),ll(B)*ll(mid));
		for (int i = 0; i < mx1; ++i){
			ava.insert(X[i/mid]);
		}
		for (int i = 0; i < mx2; ++i){
			ad.push_back(Y[i/mid]);
		}
		int j = size(q)-1;
		int done = 0;
		while(j >= 0){
			auto fr = q[j];
			auto fl = ava.upper_bound(fr.second);
			if(fl == ava.end()){
				if(done != size(ad)){
					if(ad[done] <= fr.first){
						good = 0;
						break;
					}else{
						done++;		
					}
				}else{
					good = 0;
					break;
				}
			}else{
				ava.erase(fl);
			}
			j--;
		}
		if(good){
			ans = mid;
			r = mid-1;
		}else{
			l = mid+1;
		}
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:51:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(done != size(ad)){
        ~~~~~^~~~~~~~~~~

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