# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993328 | MrDeboo | Robots (IOI13_robots) | C++17 | 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.
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
#include "robots.h"
#include "bits/stdc++.h"
using namespace std;
vector<pair<int,int>>v;
int mid;
deque<int>a,b;
map<int,int>mp;
bool bol;
bool slv(){
if(!bol){
priority_queue<int>pq;
int l=0;
for(int i=0;i<a.size();i++){
while(l<v.size()&&a[i]>v[l].first){
pq.push({v[l].second,v[l].first});
l++;
}
int k=mid;
while(pq.size()&&k--){
if(!bol)mp[pq.top().first]++;
pq.pop();
}
}
return pq.empty();
}
int g=0;
int l=0;
for(int i=0;i<a.size();i++){
while(l<v.size()&&a[i]>v[l].first){
if(bol&&mp[v[l].first])mp[v[l].first]--;
else g++;
l++;
}
int k=mid;
g=max(0,g-k);
}
while(l<v.size()&&g==0){
if(bol&&mp[v[l].first])mp[v[l].first]--;
else g++;;
l++;
}
return g==0;
}
int putaway(int A, int B, int t, int x[], int y[], int w[], int s[]) {
if(A<B){
swap(A,B);
swap(x,y);
swap(w,s);
}
for(int i=0;i<t;i++)v.push_back({w[i],s[i]});
for(int i=0;i<A;i++)a.push_back(x[i]);
for(int i=0;i<B;i++)b.push_back(y[i]);
sort(a.begin(),a.end());
sort(b.begin(),b.end());
int l=1,r=t,f=-1;
vector<pair<int,int>>vec=v;
sort(vec.begin(),vec.end());
vector<pair<int,int>>vec2=v;
for(auto &i:vec2)swap(i.first,i.second);
sort(vec2.begin(),vec2.end());
while(l<=r){
mid=(l+r)/2;
swap(v,vec);
mp.clear();
bol=0;
slv();
swap(v,vec);
bol=1;
v=vec2;
swap(a,b);
swap(v,vec2);
bool bl=slv();
swap(v,vec2);
swap(a,b);
if(bl){
r=mid-1;
f=mid;
}else l=mid+1;
}
return f;
}