# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1113772 | sunboi | Robots (IOI13_robots) | C++17 | 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>
#include"robots.h
using namespace std;
int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]){
sort(X, X + A);
reverse(X, X + A);
vector<pair<int, int>> a(T);
bool f = 0;
for (int i = 0; i < T; i++){
a[i] = {W[i], S[i]};
if (a[i].first >= X[0]) f = 1;
}
if (f) return -1;
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int ini = 1, fin = T + 1;
while(ini < fin){
int m = (ini + fin) / 2;
int k = 0;
int tiempo = 0;
for (int i = 0; i < A; i++){
tiempo = 0;
while(k < T && tiempo < m && X[i] > a[k].first){
k++;
tiempo++;
}
}
if (k == T){
fin = m;
}else ini = m + 1;
}
return ini;
}