Submission #308865

#	Time	Username	Problem	Language	Result	Execution time	Memory
308865		kylych03	Robots (IOI13_robots)	C++14	28 / 100	268 ms	12152 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() );
    //reverse(toy, toy + T);
    if(T==2 && A+B ==2){
        if(A==2){
            if(X[1] <= max(W[0], W[1]) )
                return -1;
            if(X[0] <= min(W[0], W[1]) )
                return 2;
            return 1;
        }
        else
        if(A==1){
            if( (X[0] > W[0] && Y[0] > S[1]) || (X[0] > W[1] && Y[0] > S[0]) )
                return 1;
            if((X[0] <= W[0] && Y[0]<= S[0] ) || (X[0] <= W[1] && Y[0]<= S[1] ) )
                return -1;
            return 2;
        }
        else{
            if(Y[1] <= max(S[0], S[1]) )
                return -1;
            if(Y[0] <= min(S[0], S[1]) )
                return 2;
            return 1;
        }
    }
    //reverse( X, X+ A);
    //reverse( Y, Y+ B);
    if(B==0){
        if(X[A-1] <= toy[T-1].first )
            return -1;
        int res = (T + A -1 )/ A;
        for(int i = 0; i < A - 1 ;i++){
            if( X[i] <= toy[0].first){
                res = max ( res, (T   + ( A - i-  1) -1 )/ (A - i -1 ));
            }
            int ind = upper_bound(toy.begin(), toy.end(), make_pair (X[i], 2000000002)) - toy.begin() ;
            res = max ( res, (T - ind + (A-i-1)  - 1) / ( A - i - 1));
        }
        return res;
    }
    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++;
            }
        }
        sort(vec.begin(), vec.end());
        if(vec.size()==0 ){
            r = mid-1;
            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: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37
• Subtask 5: 0 / 10