| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 545537 | timreizin | Robots (IOI13_robots) | C++17 | 1 ms | 304 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 <vector>
#include <algorithm>
#include <map>
using namespace std;
int putaway(int a, int b, int t, int X[], int Y[], int W[], int S[])
{
vector<int> x(a), y(b);
vector<pair<int, int>> ws(t);
for (int i = 0; i < a; ++i) x[i] = X[i];
for (int i = 0; i < b; ++i) y[i] = Y[i];
for (int i = 0; i < t; ++i) ws[i] = {W[i], S[i]};
sort(ws.begin(), ws.end(), [](auto a, auto b){ return a.second > b.second; });
sort(y.begin(), y.end(), greater<>());
auto check = [&ws, &x, &y](int m) -> bool
{
multimap<int, int> help;
for (int i : x) help.insert({i, m});
vector<int> left(y.size(), m);
int ind = 0;
for (auto [w, s] : ws)
{
auto it = help.upper_bound(w);
if (it == help.end())
{
if (ind == left.size()) return false;
if (y[ind] <= s) return false;
--left[ind];
if (left[ind] == 0) ++ind;
continue;
}
--it->second;
if (it->second == 0) help.erase(it);
}
return true;
};
if (!check(t)) return -1;
int l = 0, r = t;
while (l < r)
{
int m = (l + r) >> 1;
if (check(m)) r = m;
else l = m + 1;
}
return l;
}
Compilation message (stderr)
| # | 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... | ||||
