# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1126067 | m_bezrutchka | Robots (IOI13_robots) | C++20 | 1 ms | 324 KiB |
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
// sub2
assert(B == 0);
sort(X, X + A);
multiset<int> toys;
for (int i = 0; i < T; i++) {
toys.insert(W[i]);
}
multiset<int> robots;
for (int i = 0; i < A; i++) {
robots.insert(-X[i]);
}
int resp = 0;
while (true) {
resp++;
vector<int> to_delete_robots;
vector<int> to_delete_toys;
for (int x: robots) {
auto it = toys.lower_bound(-x);
if (it == toys.begin()) {
to_delete_robots.push_back(x);
} else {
it--;
to_delete_toys.push_back(*it);
# | 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... |