# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993561 | MuntherCarrot | Robots (IOI13_robots) | C++14 | 0 ms | 0 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.
//#pragma GCC optimize("Ofast,O3,unroll-loops")
//#pragma GCC target("avx2,avx,sse3,sse4")
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
if (A > B) {
swap(A, B);
swap(X, Y);
swap(W, S);
}
sort(X, X+A);
sort(Y, Y+B);
vector<pair<int, int>> v;
for (int i = 0; i < T; i++)
v.push_back({W[i], S[i]});
sort(v.begin(), v.end());
for (int i = 0; i < T; i++) {
W[i] = v[i].first, S[i] = v[i].second;
}
int l = 1, r = T, ans = -1;
while (l <= r) {
const int mid = (l+r)/2;
int idx = 0;
priority_queue<int> pq;
for (int i = 0; idx < T && i < A; i++) {
while (idx < T && W[idx] < X[i]) {
pq.push(S[idx]);
idx++;
}
for (int j = 0; pq.size() && j < mid; j++)
pq.pop();
}
while (idx <= T) {
pq.push(S[idx]);
idx++;
}
for (int i = B-1; pq.size() && i >= 0; i--) {
for (int j = 0; ok && pq.size() && j < mid; j++) {
if (pq.top() >= Y[i]) {
break;
}
pq.pop();
}
}
if (pq.empty())
r = mid - 1, ans = mid;
else
l = mid+1;
}
return ans;
}