Submission #414711

#TimeUsernameProblemLanguageResultExecution timeMemory
414711blueRobots (IOI13_robots)C++17
14 / 100
206 ms15396 KiB
#include "robots.h"
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
    sort(X, X+A, [] (int x, int y)
    {
        return x > y;
    });

    vector<int> ct(A+1, 0);
    for(int j = 0; j < T; j++)
    {
        int bit = -1; //locate last robot that can handle toy j
        for(int b = 18; b >= 0; b--)
        {
            if(bit + (1 << b) >= A) continue;
            if(X[bit + (1 << b)] <= W[j]) continue;
            bit += (1 << b);
        }
        ct[bit+1]++;
    }

    int res = 0;
    int sm = 0;

    if(ct[0]) return -1;
    for(int i = 1; i <= A; i++)
    {
        sm += ct[i];
        res = max(res, sm/i + ((sm%i) ? 1 : 0));
    }

    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...