| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 918453 | Macker | 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.
//#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
bool used[1000005];
int tt;
vector<pair<int, int>> wi;
vector<int> x, y;
bool can(int t, int* W, int* S){
multimap<int, int> sicur;
memset(used, 0, 1000005);
int cnt = 0, j = 0;
for (auto &i : wi) {
while(j < x.size() && i.first >= x[j]){
cnt = 0;
while(cnt < t && sicur.size()){
int k = (*--sicur.end()).second;
used[k] = true;
sicur.erase(--sicur.end());
cnt++;
}
j++;
}
sicur.insert({S[i.second], i.second});
}
for (int i = j; i < x.size(); i++) {
cnt = 0;
while(cnt < t && sicur.size()){
int k = (*--sicur.end()).second;
used[k] = true;
sicur.erase(--sicur.end());
cnt++;
}
}
vector<int> ss;
for (int i = 0; i < tt; i++) {
if(!used[i]) ss.push_back(S[i]);
}
if(ss.empty()) return 1;
sort(all(ss), greater<int>());
j = 0;
for (int i = y.size() - 1; i >= 0; i--) {
cnt = 0;
while(cnt < t){
if(ss[j] < y[i]) {
j++;
if(j >= ss.size()) return 1;
cnt++;
}
else return 0;
}
}
return 0;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
tt = T;
wi.reserve(T);
for (int i = 0; i < T; i++) {
wi.push_back({W[i], i});
}
sort(all(wi));
for (int i = 0; i < A; i++) x.push_back(X[i]);
for (int i = 0; i < B; i++) y.push_back(Y[i]);
sort(all(x));
sort(all(y));
int l = 0, r = T + 1, mid;
while(l < r){
mid = (l + r) / 2;
if(can(mid, W, S)) r = mid;
else l = mid + 1;
}
if(r == T + 1) return -1;
return r;
}