# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957596 | 2024-04-04T05:01:52 Z | vjudge1 | Robots (IOI13_robots) | C++17 | 0 ms | 0 KB |
#include "robots.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define se second #define fi first int putaway(int a, int b, int t, int x[], int y[],int w[], int s[]) { vector <pair<int,int>> vec; for(int i=0;i<a;i++){ vec.pb({x[i],1}); } for(int i=0;i<t;i++){ vec.pb({w[i],s[i]}); } sort(vec.begin(),vec.end()); sort(y.begin(),y.end(),greater<int>()); int l=0; int r=t+1; int ans=-1; while(l<r){ int md=(l+r)>>1; bool ok=1; priority_queue<pair<int,int>>pq; for(int i=0;i<(int)vec.size();i++){ if(vec[i].se==1){ for(int j=0;j<md;j++){ if(pq.size())pq.pop(); } } else{ pq.push(vec[i]); } } priority_queue<int> pq2; while(pq.size()){ pq2.push(pq.top().se); pq.pop(); } for(int i=0;i<b;i++){ if(!pq2.size())break; if(pq2.top()>=y[i]){ ok=0; break; } else{ for(int j=0;j<md;j++){ if(pq2.size())pq2.pop(); } } } if(ok){ ans=md; r=md; } else{ l=md+1; } } return ans; }