# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
790879 | tch1cherin | Ball Machine (BOI13_ballmachine) | C++17 | 1093 ms | 82492 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>
using namespace std;
const int MAX_N = 1e5 + 5;
vector<int> G[MAX_N];
priority_queue<pair<int, int>> go[MAX_N];
int min_value[MAX_N], cnt_empty[MAX_N], parent[MAX_N], balls[MAX_N] = {}, root;
queue<int> q;
void DFS(int u) {
cnt_empty[u] = 1;
for (int v : G[u]) {
DFS(v);
cnt_empty[u] += cnt_empty[v];
go[u].push({-min_value[v], v});
min_value[u] = min(min_value[u], min_value[v]);
}
sort(G[u].begin(), G[u].end(), [](int i, int j) {
return min_value[i] < min_value[j];
});
}
void rolldown(int u, bool insert = true) {
if (go[u].empty()) {
return;
}
int v = go[u].top().second;
go[u].pop();
balls[u]--, balls[v]++;
cnt_empty[v]--;
Compilation message (stderr)
# | 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... |