제출 #769265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
769265		keta_tsimakuridze	로봇 (IOI13_robots)	C++14	100 / 100	1327 ms	24420 KiB

robots

#include "robots.h"
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
int putaway(int A, int B, int N, int X[], int Y[], int W[], int S[]) {

    vector<pair<int,int>> p(N);
    for(int i = 0; i < N; i++) {
        p[i] = {W[i], S[i]};
    }
    sort(p.begin(), p.end());
//    for(int i = 0; i < N; i++) cout << p[i].f << " " << p[i].s << "\n";

    sort(X, X + A); sort(Y, Y + B);
    int l = 1, r = N, ans = N + 1;
    while(l <= r) {
        int mid = (l + r) / 2;
        priority_queue<int, vector<int>, less<int>> s;
        {
            int L = -1;
            for(int i = 0; i < A; i++) {
                while(L + 1 < N && p[L + 1].f < X[i]) ++L, s.push(p[L].s);

                for(int j = 1; j <= mid; j++) {
                    if(!s.size()) break;
                    s.pop();

                }
            }
            while(L + 1 < N)  s.push(p[L + 1].s),++L;
            for(int i = B - 1; i >= 0; i--) {
                for(int j = mid; j >= 1; j--) {
                    if(!s.size() || s.top() >= Y[i]) break;
                    s.pop();
                }
            }
        }
        if(s.size()) l = mid + 1;
        else r = mid - 1, ans = mid;
    }
    if(ans > N ) ans = -1;
    return ans;
}

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