| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 83519 | nikolapesic2802 | 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 <bits/stdc++.h>
#define pb push_back
using namespace std;
pair<int,int> maxx=make_pair(INT_MAX,INT_MAX);
int putaway(int a, int b, int t, int x[], int y[], int W[], int S[]) {
sort(x,x+a);
sort(y,y+a);
reverse(y,y+a);
vector<pair<int,int> > items(t);
for(int i=0;i<t;i++)
{
items[i].first=W[i];
items[i].second=S[i];
}
items.pb(maxx);
sort(items.begin(),items.end());
int l=1,r=t+1;
while(l<r)
{
int mid=(l+r)/2;
//printf("%i\n",mid);
int j=0;
int test=true;
multiset<int,greater<int> > s;
for(int i=0;i<a;i++)
{
//printf("Usao za %i\n",x[i]);
while(items[j].first<x[i])
{
//printf("Dodajem %i %i\n",items[j].first,items[j].second);
s.insert(items[j].second);
j++;
}
for(int k=0;k<mid;k++)
{
if(s.empty())
break;
s.erase(s.begin());
//printf("brisem!\n");
}
}
for(;j<t;j++)
s.insert(items[j].second);
for(int i=0;i<b;i++)
{
//printf("usao! %i\n",y[i]);
for(int k=0;k<mid;k++)
{
if(s.size()==0)
{
break;
break;
}
if(*s.begin()<y[i])
s.erase(s.begin());
else
{
break;
break;
}
}
}
if(s.size()!=0)
test=false;
if(test)
{
r=mid;
}
else
{
l=mid+1;
}
}
if(l==t+1)
return -1;
return l;
}