# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
550856 | David_M | Robots (IOI13_robots) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
int ans=-1;
vector<array<int, 3>> p(T);
for (int i=0; i<T; i++)p[i]={W[i]+1, S[i]+1, i};
sort(all(p));
sort(X, X+A);
sort(Y, Y+B);
int l=1, r=T+1;
while(l<=r){
int m=l+r>>1;
int M=0, k=0, o=0;
vector<bool> f(T,0);
vector<int> v;
priority_queue<array<int, 2>> s;
for (auto x : X){
M=m;
while(k<T && x>=p[k][0])
s.push({p[k][1],p[k][2]}), k++;
while(!s.empty() && M--)
f[s.top()[1]]=1, s.pop();
}
for (int i=0; i<T; i++)
if(!f[i])v.pb(S[i]+1);
sort(all(v));
k=M=0;
for (auto y : v){
if(k==B){o=1;break;}
while(k<B && y>Y[k])k++,M=0;
if(k==B){o=1;break;}
M++;
if(M==m)k++,M=0;
}
if(o)l=m+1; else ans=m, r=m-1;
}
return ans;
}