제출 #254275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254275		AaronNaidu	로봇 (IOI13_robots)	C++14	90 / 100	3068 ms	23132 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"
using namespace std;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    sort(X, X+A);
    reverse(X, X+A);
    sort(Y, Y+B);
    reverse(Y, Y+B);
    vector<pair<int, int> > toys;

    for (int i = 0; i < T; i++)
    {
        toys.push_back({W[i], S[i]});
    }
    sort(toys.begin(), toys.end());
    reverse(toys.begin(), toys.end());

    for (int i = 0; i < T; i++)
    {
        if (W[i] >= X[0] and S[i] >= Y[0])
        {
            return -1;
        }
        
    }

    float maxMinutes = 0;
   
    for (int i = 0; i <= B; i++)
    {
        float toyCount = 0;
        float robotCount;
        if (i == 0)
        {
            robotCount = 1;
        }
        else
        {
            robotCount = 0;
        }
        vector<int> remToys;
        for (int k = 0; k < T; k++)
        {
            if (i == B or toys[k].second >= Y[i])
            {
                remToys.push_back(toys[k].first);
            }
        }
        while (toyCount < remToys.size() and robotCount < A)
        {
            if (remToys[int(toyCount)] >= X[int(robotCount)])
            {
                toyCount++;
            }
            else
            {
                maxMinutes = max(maxMinutes, toyCount/(i+robotCount));
                robotCount++;
            }
            
        }
        maxMinutes = max(maxMinutes, float(remToys.size())/float(i+robotCount));
    }
    
    maxMinutes = ceil(maxMinutes);
    return int(maxMinutes);
}

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