제출 #787657

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
787657		drdilyor	로봇 (IOI13_robots)	C++17	0 / 100	2 ms	468 KiB

robots

#include "robots.h"
#include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
using namespace std;

int putaway(int wrobot, int srobot, int n, int rw[], int rs[], int w[], int s[]) {

    assert(srobot == 0);
    sort(rw, rw + wrobot);
    sort(w, w + n);
    if (!wrobot && !srobot) {
        return 0;
    }


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

    int l = -1, r = n +1;
    while (l < r - 1) {
        int mid = (l + r) / 2;
        if (check(mid)) r = mid;
        else l = mid;
    }
    return r == n+1 ? -1 : r;
}

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