제출 #308871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308871		kylych03	로봇 (IOI13_robots)	C++14	0 / 100	3087 ms	10036 KiB

robots

#include "robots.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
vector <pair <int,int> > toy;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    sort(X, X+A);
    sort(Y, Y+B);
    toy.resize(T);
    for(int i = 0 ; i < T ; i++){
        toy[i].first = W[i];
        toy[i].second = S[i];
        if(W[i]>= X[A-1] && S[i]>=Y[B-1])
            return -1;

    }
    sort(toy.begin(), toy.end() );

    int l =  1, r = T;
    int ans = T;
    while(r - l > 0){
        int mid = (l + r) / 2;
        deque <int > vec;
        int cnt = 0;

        for(int  i = 0 ; i < A ; i++){
            int sz = 0;
            while( cnt < T && X[i] > toy[cnt].first){
                vec.push_back(toy[cnt].second);
                cnt++;
            }
            sort(vec.begin(), vec.end());
            reverse(vec.begin(), vec.end());

            while(vec.size()> 0 && sz<mid){
                vec.erase(vec.begin());
                sz++;
            }
            if(i==A-1){
                while(cnt < T){
                    vec.push_back(toy[cnt].second);
                    cnt++;
                }
            }
        }
        sort(vec.begin(), vec.end());


        for(int i = 0 ; i < B; i++){
            int sz =0;
            while(vec.size()> 0 && sz < mid && vec[0]< Y[i] ){
                vec.erase(vec.begin());
                sz++;
            }
        }
        if(vec.size()==0 ){
            r = mid;
            ans = mid;
        }
        else{
            l = mid + 1;
        }
    }
    return ans;
}
/*
3 2 10
6 2 9
4 7
4 6
8 5
2 3
7 9
1 8
5 1
3 3
8 7
7 6
10 5
*/

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