# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127504 | MoNsTeR_CuBe | Robots (IOI13_robots) | C++17 | 2951 ms | 48440 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[]) {
#define int long long
sort(X,X+A);
sort(Y,Y+B);
for(int i = 0; i < T; i++){
if(W[i] >= X[A-1] && S[i] >= Y[B-1]){
return -1;
}
}
vector< pair<int, int> > L;
for(int i = 0; i < T; i++){
L.push_back(make_pair(W[i], S[i]));
}
sort(L.begin(), L.end());
//for(auto p : L) cout << p.first << ' ' << p.second << endl;
int left = 1, right = T;
while(left < right){
int mid = (left+right)/2;
# | 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... |