제출 #56395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56395		aquablitz11	로봇 (IOI13_robots)	C++14	76 / 100	217 ms	32480 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"
using namespace std;

using pii = pair<int, int>;
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define F first
#define S second

const int N = 50010;
const int INF = 2e9+1;

int A, B, T;
int *X, *Y, *W, *S, ix[N];
bool used[N];

bool check(int tim)
{
    for (int i = 0; i < T; ++i) {
        ix[i] = i;
        used[i] = false;
    }

    // weak robot matching
    sort(ix, ix+T, [&] (int a, int b) {
        return W[a] < W[b];
    });
    int j = 0;
    priority_queue<pii> Q;
    for (int i = 0; i < A; ++i) {
        while (j < T && W[ix[j]] < X[i]) {
            Q.push({S[ix[j]], ix[j]});
            ++j;
        }
        for (int cnt = 0; cnt < tim && !Q.empty(); ++cnt) {
            used[Q.top().second] = true;
            Q.pop();
        }
    }

    // small robot matching
    sort(ix, ix+T, [&] (int a, int b) {
        return S[a] < S[b];
    });
    j = 0;
    while (!Q.empty()) Q.pop();
    for (int i = 0; i < B; ++i) {
        while (j < T && S[ix[j]] < Y[i]) {
            if (!used[ix[j]])
                Q.push({W[ix[j]], ix[j]});
            ++j;
        }
        for (int cnt = 0; cnt < tim && !Q.empty(); ++cnt) {
            used[Q.top().second] = true;
            Q.pop();
        }
    }

    // check
    for (int i = 0; i < T; ++i) {
        if (!used[i])
            return false;
    }

    return true;
}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
    ::A = A, ::B = B, ::T = T, ::X = X, ::Y = Y, ::W = W, ::S = S;
    sort(X, X+A);
    sort(Y, Y+B);
    int b = 1, e = T+1;
    while (b < e) {
        int m = (b+e)/2;
        if (check(m))
            e = m;
        else
            b = m+1;
    }
    return b == T+1 ? -1 : b;
}

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