# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159629 | rama_pang | Robots (IOI13_robots) | C++14 | 2036 ms | 26680 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 A, B, T;
vector<int> robotW, robotS, W, S, items;
bool is_possible(int t) {
priority_queue<int> size; // sorted by size
int cur = 0;
for (int i = 0; i < A; i++) {
while (cur < T && W[items[cur]] < robotW[i]) size.push(S[items[cur++]]);
int sz = size.size();
while (size.size() > max(0, sz - t)) size.pop();
}
while (cur < T) size.push(S[items[cur++]]);
for (int i = B - 1; i >= 0; i--) {
int sz = size.size();
while (size.size() > max(0, sz - t) && size.top() < robotS[i]) size.pop();
}
return size.empty();
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
for (int i = 0; i < T; i++) ::W.push_back(W[i]);
for (int i = 0; i < T; i++) ::S.push_back(S[i]);
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... |