제출 #545541

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

robots

#include "robots.h"
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int putaway(int a, int b, int t, int X[], int Y[], int W[], int S[])
{
    vector<int> x(a), y(b);
    vector<pair<int, int>> ws(t);
    for (int i = 0; i < a; ++i) x[i] = X[i];
    for (int i = 0; i < b; ++i) y[i] = Y[i];
    for (int i = 0; i < t; ++i) ws[i] = {W[i], S[i]};
    sort(ws.begin(), ws.end(), [](auto a, auto b){ return a.second > b.second; });
    auto check = [&ws, &x, &y](int m) -> bool
    {
        multimap<int, int> help;
        for (int i : x) help.insert({i, m});
        multimap<int, int> help2;
        for (int i : y) help.insert({i, m});
        for (auto [w, s] : ws)
        {
            auto it = help.upper_bound(w);
            if (it == help.end())
            {
                auto it = help2.upper_bound(s);
                if (it == help2.end()) return false;
                --it->second;
                if (it->second == 0) help2.erase(it);
                continue;
            }
            --it->second;
            if (it->second == 0) help.erase(it);
        }
        return true;
    };
    if (!check(t)) return -1;
    int l = 0, r = t;
    while (l < r)
    {
        int m = (l + r) >> 1;
        if (check(m)) r = m;
        else l = m + 1;
    }
    return l;
}

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