Submission #1105023

#	Time	Username	Problem	Language	Result	Execution time	Memory
1105023		tammaidai	Robots (IOI13_robots)	C++17	0 / 100	2 ms	4432 KiB

robots

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

struct AB
{
    int w,s;
    bool operator<(const AB&o)const{
        return w<o.w;
    }
};

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    int l = 1,r=1000000;
    vector<AB> t;
    for(int i = 0;i<T;i++){
        t.push_back({W[i],S[i]});
    }
    sort(t.begin(),t.end());
    sort(X,X+A);
    sort(Y,Y+B);
    while(l<r){
        int m = (l+r)>>1;
        int idx = 0;
        priority_queue<int> pq;
        for(int i = 0;i<A;i++){
            for(;idx<T;idx++){
                if(t[idx].w>X[i])break;
                pq.push(t[idx].s);
            }
            int cnt = 0;
            while(!pq.empty() && cnt<m){
                pq.pop();
                cnt++;
            }
        }
        for(;idx<T;idx++){
            pq.push(t[idx].s);
        }
        for(int i = B-1;i>=0;i--){
            int cnt =  0;
            if(pq.empty() || pq.top()>Y[i])break;
            while(!pq.empty() && cnt<m){
                pq.pop();
                cnt++;
            }
        }
        if(pq.empty()){
            l=m+1;
        }
        else{
            r=m;
        }
    }
    return l;
}

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