| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 944383 | wii | Robots (IOI13_robots) | C++17 | 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;
const int MaxN = 5e4 + 5;
int cnt[MaxN], jump[MaxN];
priority_queue<int, vector<int>, greater<int>> q[MaxN];
struct comp {
bool operator() (int x, int y) {
if (q[x].size() == q[y].size())
return x < y;
return q[x].size() > q[y].size();
}
};
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
bool impossible = false;
function<void(int)> pushSize = [&](int s) {
int id = upper_bound(Y, Y + A, s) - Y;
if (id < B)
cnt[id] += 1;
else impossible = true;
};
function<void(int, int)> pushWeight = [&](int w, int s) {
int id = upper_bound(X, X + A, w) - X;
if (id < A)
q[id].push(s);
else pushSize(s);
};
function<int(int, int)> movetoTop = [&](int u, int top) {
if (u >= A)
return u;
if (q[u].size() > top)
return jump[u] = movetoTop(jump[u], top);
else
return u;
};
function<void(int)> balance = [&](int lim) {
for (int i = 0; i < B; ++i) {
if (cnt[i] > lim)
cnt[i + 1] += cnt[i] - lim, cnt[i] = lim;
}
if (cnt[B] > lim)
impossible = true;
};
sort(X, X + A);
sort(Y, Y + B);
for (int i = 0; i < A; ++i)
jump[i] = i + 1;
for (int i = 0; i < T; ++i) {
pushWeight(W[i], S[i]);
}
if (impossible)
return -1;
set<int, comp> s;
for (int i = 0; i < A; ++i) if (q[i].size())
s.insert(i);
int lst = -1;
while (!s.empty()) {
int u = *s.begin(); s.erase(s.begin());
int v = movetoTop(u, q[u].size() - 1);
if (lst != q[u].size()) {
balance(q[u].size() - 1);
if (impossible)
return lst;
}
lst = q[u].size();
int Size = q[u].top(); q[u].pop();
if (v < A) {
s.erase(v);
q[v].push(Size);
s.insert(v);
} else {
pushSize(Size);
}
if (!q[u].empty())
s.insert(u);
}
return 1;
}