# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
511459 | tabr | Robots (IOI13_robots) | C++17 | 592 ms | 24352 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>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
#ifndef tabr
#include "robots.h"
#endif
int putaway(int a, int b, int t, int x[], int y[], int w[], int s[]) {
sort(x, x + a);
sort(y, y + b);
vector<pair<int, int>> z;
for (int i = 0; i < t; i++) {
if (w[i] >= x[a - 1] && s[i] >= y[b - 1]) {
return -1;
}
int z1 = (int) (x + a - upper_bound(x, x + a, w[i]));
int z2 = (int) (y + b - upper_bound(y, y + b, s[i]));
z.emplace_back(z1, z2);
}
sort(z.begin(), z.end());
int low = 0;
int high = t;
while (high - low > 1) {
# | 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... |