| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 7023 |
2014-07-12T14:31:45 Z |
gs13068 |
Robots (IOI13_robots) |
C++ |
|
3000 ms |
19668 KB |
#include "robots.h"
#include<algorithm>
#include<set>
int V[1000000];
std::pair<int,int> D[1000000];
int R[50000];
std::set<std::pair<int,int> > E;
std::set<std::pair<int,int> >::iterator it;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
int i,j,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;
l=1;r=T;
while(l<r)
{
mid=(l+r)/2;
E.clear();
for(i=0;i<T;i++)V[i]=0;
E.insert(std::make_pair(0,-2));
for(i=0;i<B;i++)
{
R[i]=0;
E.insert(std::make_pair(Y[i],i));
}
for(i=T-1;i>=0;i--)
{
it=E.lower_bound(std::make_pair(D[i].second,-1));
if(it!=E.end())
{
V[i]=1;
R[it->second]++;
if(R[it->second]==mid)E.erase(it);
}
}
for(i=0;i<A;i++)R[i]=0;
j=0;
for(i=0;i<T;i++)if(!V[i])
{
while(j<A&&(X[j]<D[i].first||R[j]==mid))j++;
if(j<A)
{
V[i]=1;
R[j]++;
}
else break;
}
if(i==T)r=mid;
else l=mid+1;
}
return r;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 3 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 4 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 5 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 6 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 7 |
Correct |
4 ms |
17424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 3 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 4 |
Correct |
300 ms |
17424 KB |
Output is correct |
| 5 |
Correct |
232 ms |
17424 KB |
Output is correct |
| 6 |
Correct |
40 ms |
17424 KB |
Output is correct |
| 7 |
Correct |
288 ms |
17424 KB |
Output is correct |
| 8 |
Correct |
316 ms |
17424 KB |
Output is correct |
| 9 |
Correct |
284 ms |
17424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 3 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 4 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 5 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 6 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 7 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 8 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 9 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 10 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 11 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 12 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 13 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 14 |
Correct |
0 ms |
17424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 3 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 4 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 5 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 6 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 7 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 8 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 9 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 10 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 11 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 12 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 13 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 14 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 15 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 16 |
Correct |
12 ms |
17424 KB |
Output is correct |
| 17 |
Correct |
16 ms |
17424 KB |
Output is correct |
| 18 |
Correct |
4 ms |
17424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 3 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 4 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 5 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 6 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 7 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 8 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 9 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 10 |
Correct |
304 ms |
17424 KB |
Output is correct |
| 11 |
Correct |
220 ms |
17424 KB |
Output is correct |
| 12 |
Correct |
36 ms |
17424 KB |
Output is correct |
| 13 |
Correct |
292 ms |
17424 KB |
Output is correct |
| 14 |
Correct |
304 ms |
17424 KB |
Output is correct |
| 15 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 16 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 17 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 18 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 19 |
Correct |
4 ms |
17424 KB |
Output is correct |
| 20 |
Correct |
0 ms |
17424 KB |
Output is correct |
| 21 |
Correct |
12 ms |
17424 KB |
Output is correct |
| 22 |
Correct |
808 ms |
19668 KB |
Output is correct |
| 23 |
Correct |
284 ms |
17424 KB |
Output is correct |
| 24 |
Correct |
2508 ms |
19668 KB |
Output is correct |
| 25 |
Execution timed out |
3000 ms |
19668 KB |
Program timed out |
| 26 |
Halted |
0 ms |
0 KB |
- |
