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 putaway(int a, int b, int t, int x[], int y[], int w[], int s[]) {
int ans = -1;
sort(x, x + a);
sort(y, y + b);
reverse(y, y + b);
int l = 1, r = t;
while (l <= r){
int mid = (l + r) / 2;
int pt = 0;
multiset<int> st;
for (int i = 0; i < a; ++i){
while (pt < t && w[pt] < x[i]) st.insert(s[pt++]);
for (int j = 0; j < mid; ++j){
if (st.empty()) break;
st.erase(--st.end());
}
}
while (pt < t) st.insert(s[pt++]);
int cur = 0;
while (!st.empty()){
if (cur >= mid) break;
cur++;
for (int i = 0; i < b; ++i){
auto it = st.lower_bound(y[i]);
if (it == st.begin()){
if (i == 0) cur = t+1;
break;
}
it--;
st.erase(it);
}
}
if (cur <= mid) ans = mid, r = mid - 1;
else l = mid + 1;
}
return ans;
}
# | 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... |