# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56417 | aquablitz11 | Robots (IOI13_robots) | C++14 | 2251 ms | 13108 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>
#include "robots.h"
using namespace std;
using pii = pair<int, int>;
#define F first
#define S second
int A, B, T, *X, *Y;
vector<pii> toys;
bool check(int lim)
{
priority_queue<int> Q;
int j = 0;
for (int i = 0; i < A; ++i) {
while (j < T && toys[j].F < X[i])
Q.emplace(toys[j++].S);
for (int c = 0; c < lim && !Q.empty(); ++c)
Q.pop();
}
while (j < T) Q.emplace(toys[j++].S);
for (int i = B-1; i >= 0; --i) {
if (!Q.empty() && Q.top() >= Y[i]) return false;
for (int c = 0; c < lim && !Q.empty(); ++c)
Q.pop();
}
return Q.empty();
}
# | 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... |