| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 16495 |
2015-08-26T12:58:08 Z |
CodingBug |
Robots (IOI13_robots) |
C++ |
|
2348 ms |
17160 KB |
#include "robots.h"
#include <queue>
#include <algorithm>
#define N 50000
#define M 1000000
using namespace std;
typedef pair<int,int> ppair;
int a[N+1],b[N+1],na,nb,m;
ppair s[M+1];
priority_queue<int> Q;
bool check(int lmt){
int i,j,k;
while(!Q.empty()) Q.pop();
for(i=0,j=0;i<na;i++){
for(;j<m && s[j].first<a[i];j++) Q.push(s[j].second);
for(k=0;k<lmt && !Q.empty();k++) Q.pop();
}
for(;j<m;j++) Q.push(s[j].second);
for(i=nb-1;i>=0;i--){
for(k=0;k<lmt && !Q.empty() && Q.top()<b[i];k++) Q.pop();
}
return Q.empty();
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
int i;
na=A; nb=B; m=T;
for(i=0;i<na;i++) a[i]=X[i];
for(i=0;i<nb;i++) b[i]=Y[i];
for(i=0;i<m;i++) s[i]=make_pair(W[i],S[i]);
sort(a,a+na);
sort(b,b+nb);
sort(s,s+m);
int st,ed,mid;
for(st=0,ed=T;st<ed;check(mid) ? ed=mid : st=mid+1) mid=(st+ed)/2;
if(check(st)) return st;
return -1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
14084 KB |
Output is correct |
| 2 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 3 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 4 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 5 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 6 |
Correct |
5 ms |
14084 KB |
Output is correct |
| 7 |
Correct |
0 ms |
14084 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 2 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 3 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 4 |
Correct |
1687 ms |
17160 KB |
Output is correct |
| 5 |
Correct |
2132 ms |
17160 KB |
Output is correct |
| 6 |
Correct |
42 ms |
14084 KB |
Output is correct |
| 7 |
Correct |
565 ms |
15624 KB |
Output is correct |
| 8 |
Correct |
1144 ms |
17160 KB |
Output is correct |
| 9 |
Correct |
2348 ms |
17160 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 2 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 3 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 4 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 5 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 6 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 7 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 8 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 9 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 10 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 11 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 12 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 13 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 14 |
Correct |
0 ms |
14084 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 2 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 3 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 4 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 5 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 6 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 7 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 8 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 9 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 10 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 11 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 12 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 13 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 14 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 15 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 16 |
Correct |
20 ms |
14084 KB |
Output is correct |
| 17 |
Correct |
16 ms |
14084 KB |
Output is correct |
| 18 |
Correct |
26 ms |
14084 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 2 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 3 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 4 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 5 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 6 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 7 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 8 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 9 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 10 |
Correct |
1712 ms |
17160 KB |
Output is correct |
| 11 |
Correct |
2106 ms |
17160 KB |
Output is correct |
| 12 |
Correct |
43 ms |
14084 KB |
Output is correct |
| 13 |
Correct |
556 ms |
15624 KB |
Output is correct |
| 14 |
Correct |
1172 ms |
17160 KB |
Output is correct |
| 15 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 16 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 17 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 18 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 19 |
Correct |
3 ms |
14084 KB |
Output is correct |
| 20 |
Correct |
0 ms |
14084 KB |
Output is correct |
| 21 |
Correct |
19 ms |
14084 KB |
Output is correct |
| 22 |
Correct |
2248 ms |
17160 KB |
Output is correct |
| 23 |
Correct |
2230 ms |
17160 KB |
Output is correct |
| 24 |
Correct |
1308 ms |
17160 KB |
Output is correct |
| 25 |
Correct |
745 ms |
14856 KB |
Output is correct |
| 26 |
Correct |
1638 ms |
17160 KB |
Output is correct |
| 27 |
Correct |
945 ms |
17160 KB |
Output is correct |
| 28 |
Correct |
1024 ms |
17160 KB |
Output is correct |
| 29 |
Correct |
2270 ms |
17160 KB |
Output is correct |
