Submission #1165219

#	Time	Username	Problem	Language	Result	Execution time	Memory
1165219		HappyCapybara	Robots (IOI13_robots)	C++20	76 / 100	3095 ms	8904 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++){
        vector<int> v;
        for (int j=0; j<T; j++){
            if (w[j] >= x[i]) v.push_back(s[j]);
        }
        sort(v.begin(), v.end());
        reverse(v.begin(), v.end());
        int ts = 0;
        for (int j=0; j<=B; j++){
            while (ts != v.size() && v[ts] >= 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: 37 / 37
• Subtask 5: 0 / 10