# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7037 | gs13068 | Robots (IOI13_robots) | C++98 | 508 ms | 22552 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<algorithm>
#include<set>
#include<vector>
int V[1000000];
std::pair<int,int> D[1000000];
int R[50000];
std::vector<int> E[50000];
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
int i,j,k,l,r,mid;
for(i=0;i<T;i++)
{
D[i].first=W[i]+1;
D[i].second=S[i]+1;
}
std::sort(X,X+A);
std::sort(Y,Y+B);
std::sort(D,D+T);
for(i=0;i<T;i++)if((!A||D[i].first>X[A-1])&&(!B||D[i].second>Y[B-1]))return -1;
for(i=0;i<B;i++)E[i].clear();
for(i=0;i<T;i++)
{
j=std::lower_bound(Y,Y+B,D[i].second)-Y;
if(j<B)E[j].push_back(i);
}
l=1;r=T;
while(l<r)
# | 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... |