# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79383 | shoemakerjo | Robots (IOI13_robots) | C++14 | 1904 ms | 64324 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;
#define maxn 50010
vector<int> sizes[maxn];
vector<int> ys;
int a, b;
priority_queue<int> active;
bool check(int mid) {
while (active.size()) active.pop();
// priority_queue<int> active;
for (int i = 0; i < a; i++) {
for (int vv : sizes[i]) active.push(vv);
for (int j = 0; j < mid; j++) {
if (!active.size()) break;
active.pop();
}
}
for (int vv : sizes[a]) active.push(vv);
// // cout << mid << " interim size: " << active.size() << endl;
// for (int thing : active) {
// cout << " " << thing << endl;
// }
# | 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... |