Submission #787628

#TimeUsernameProblemLanguageResultExecution timeMemory
787628drdilyorRobots (IOI13_robots)C++17
0 / 100
1 ms340 KiB
#include "robots.h"
#include <algorithm>
#include <cassert>
using namespace std;

int putaway(int a, int b, int t, int x[], int y[], int w[], int s[]) {

    assert(b == 0);
    sort(w, w + t);
    sort(x, x + a);


    auto check = [&](int time)->bool {
        int cnt = 0;
        int toy = 0;
        for (int robot = 0; robot < a; robot++) {
            while (toy < t && w[robot] >= x[toy]) {
                toy++;
                cnt++;
            }
            cnt = max(cnt - time, 0);
        }
        return cnt == 0;
    };

    int l = -1, r = t +1;
    while (l < r - 1) {
        int mid = (l + r);
        if (check(mid)) r = mid;
        else l = mid;
    }
    return r == t+1 ? -1 : r;
}
#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...