# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234138 | tinjyu | Robots (IOI13_robots) | C++14 | 3081 ms | 384 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 <iostream>
#include <algorithm>
using namespace std;
struct node{
int w,s;
}id[1000004];
long long int a,b,t,x[1000005],y[1000005];
long long int check(int m)
{
long long int p1=t-1,p2=a-1,now=0;
while(p1>=0 || p2>=0)
{
if(x[p2]>id[p1].w || p1==-1)
{
now+=m;
p2--;
}
else
{
if(now>0)now--;
else
{
}
}
}
}
bool cmp1(const node &tmp1,const node &tmp2)
{
return tmp1.w>tmp2.w;
}
bool cmp2(long long int tmp1,long long int tmp2)
{
return tmp1>tmp2;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
a=A;
b=B;
t=T;
for(int i=0;i<a;i++)x[i]=X[i];
for(int i=0;i<b;i++)y[i]=Y[i];
for(int i=0;i<t;i++)
{
id[i].w=W[i];
id[i].s=S[i];
}
long long int l=1,r=t,ans;
sort(id,id+t,cmp1);
for(int i=0;i<t;i++)
{
cout<<id[i].w<<" "<<id[i].s<<endl;
}
sort(x,x+a,cmp2);
while(l<=r)
{
long long int mid=(l+r)/2;
if(check(mid)==1)
{
ans=mid;
r=mid-1;
}
else l=mid+1;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |