제출 #1165212

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165212		HappyCapybara	로봇 (IOI13_robots)	C++20	39 / 100	3094 ms	8788 KiB

robots

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

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    int res = 0;
    vector<int> x, y, w, s;
    for (int i=0; i<A; i++) x.push_back(X[i]);
    for (int i=0; i<B; i++) y.push_back(Y[i]);
    for (int i=0; i<T; i++){
        w.push_back(W[i]);
        s.push_back(S[i]);
    }
    x.push_back(0); y.push_back(0);
    sort(x.begin(), x.end());
    reverse(x.begin(), x.end());
    sort(y.begin(), y.end());
    reverse(y.begin(), y.end());
    for (int i=0; i<=A; i++){
        for (int j=0; j<=B; j++){
            int ts = 0;
            for (int k=0; k<T; k++){
                if (w[k] >= x[i] && s[k] >= y[j]) ts++;
            }
            if (i+j == 0){
                if (ts) return -1;
            }
            else res = max(res, (int) ceil((float) ts/ (float) (i+j)));
        }
    }
    return res;
}

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