Submission #1058960

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058960		oscarsierra12	Robots (IOI13_robots)	C++14	14 / 100	126 ms	15788 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define pb push_back


typedef long long ll;
typedef pair <ll,ll> pii;

const ll N = 110;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    sort (X, X + A);
    sort (W, W + T);

    int lw = 1, hg = T + 1;
    while (lw < hg) { 
        int mi = (lw + hg) / 2;

        int idx = A - 1;
        int can = 1;
        vector <int> use (A, 0);

        for (int i = T - 1; i >= 0; --i) { 
            while (idx >= 0 && (use[idx] == mi || X[idx] <= W[i])) idx--;
            if (idx < 0) {
                can = 0;
                break;
            }
            use[idx]++;
        }

        if (can) hg = mi;
        else lw = mi + 1;
    }
    if (lw == T + 1) return -1;
    return hg;
}

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