제출 #1064547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1064547		ArthuroWich	로봇 (IOI13_robots)	C++17	76 / 100	3090 ms	21620 KiB

robots

#include "robots.h"
#include<bits/stdc++.h>
using namespace std;
int n, m, t;
vector<int> weak, small;
vector<pair<int, int>> toy;
bool check(int x) {
    vector<int> vis(t, 0);
    for (int i : weak) {
        int co = 0;
        for (int j = 0; j < t && co < x; j++) {
            if (vis[j] || toy[j].second >= i) {
                continue;
            }
            vis[j] = 1;
            co++;
        }
    }
    for (int i : small) {
        int co = 0;
        for (int j = 0; j < t && co < x; j++) {
            if (vis[j] || toy[j].first >= i) {
                continue;
            }
            vis[j] = 1;
            co++;
        }
    }
    for (int i = 0; i < t; i++) {
        if (vis[i]) {
            continue;
        }
        return 0;
    }
    return 1;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    n = A, m = B, t = T;
    for (int i = 0; i < t; i++) {
        toy.push_back({S[i], W[i]});
    }
    for (int i = 0; i < n; i++) {
        weak.push_back(X[i]);
    }
    for (int i = 0; i < m; i++) {
        small.push_back(Y[i]);
    }
    int l = 1, r = T;
    sort(toy.rbegin(), toy.rend());
    sort(weak.begin(), weak.end());
    sort(small.begin(), small.end());
    while(l < r) {
        int m = (l+r)/2;
        if (check(m)) {
            r = m;
        } else {
            l = m+1;
        }
    }
    if (check(l)) {
        return l;
    } else {
        return -1;
    }
}

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