# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576020 | handlename | Robots (IOI13_robots) | C++17 | 1521 ms | 51876 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 <bits/stdc++.h>
using namespace std;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
sort(X,X+A);
sort(Y,Y+B);
if (true){
multiset<pair<int,int> > weight;
multiset<pair<int,int> > sizee;
for (int i=0;i<T;i++){
if (W[i]>=X[A-1] && S[i]>=Y[B-1]) return -1;
weight.insert(make_pair(W[i],S[i]));
sizee.insert(make_pair(S[i],W[i]));
}
int wstart=0,sstart=0,total=0;
while (!weight.empty()){
for (int i=wstart;i<A;i++){
auto it=weight.lower_bound(make_pair(X[i],0));
if (it==weight.begin()){
wstart=i;
continue;
}
else {
it--;
int curw=(*it).first;
int curs=(*it).second;
weight.erase(it);
sizee.erase(sizee.find(make_pair(curs,curw)));
}
}
# | 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... |