제출 #598578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598578		Jarif_Rahman	로봇 (IOI13_robots)	C++17	100 / 100	845 ms	22880 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

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

    for(int i = 0; i < n; i++) if(W[i] >= X[A-1] && S[i] >= Y[B-1]) return -1;

    vector<int> bs(n);
    for(int i = 0; i < n; i++) bs[i] = i;
    sort(bs.begin(), bs.end(), [&](int a, int b){
        return S[a] < S[b];
    });

    vector<int> nxt(n);
    for(int i = 0; i < n; i++){
        nxt[i] = upper_bound(X, X+A, W[i])-X;
    }

    function<bool(int)> check = [&](int m){
        vector<bool> marked(n, 0);
        vector<int> space(A, m);
        set<int> available;
        for(int i = 0; i < A; i++) available.insert(i);

        for(int i = n-1; i >= 0; i--){
            int x = bs[i], y = nxt[x];
            if(y == A) continue;
            if(space[y]){
                space[y]--, marked[x] = 1;
                if(!space[y]) available.erase(y);
            }
            else{
                auto it = available.upper_bound(y);
                if(it == available.end()) continue;
                space[*it]--, marked[x] = 1;
                if(!space[*it]) available.erase(it);
            }
        }

        int c = m, ls = B-1;

        for(int i = n-1; i >= 0; i--){
            if(marked[bs[i]]) continue;
            if(ls < 0) return 0;
            if(S[bs[i]] >= Y[ls]) return 0;
            c--;
            if(!c) c = m, ls--;
        }

        return 1;
    };

    int a = 1, b = n;

    while(a < b){
        int md = (a+b)/2;
        if(check(md)) b = md;
        else a = md+1;
    }

    return a;
}

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