# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518289 | athensclub | Ball Machine (BOI13_ballmachine) | C++14 | 388 ms | 26044 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 <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
int findMinSubtree(int node, vector<int> children[], int minSubtree[])
{
if (minSubtree[node] > 0)
return minSubtree[node];
int temp = node;
for (int child : children[node])
temp = min(temp, findMinSubtree(child, children, minSubtree));
minSubtree[node] = temp;
return temp;
}
void visitOrdered(int node, vector<int> children[], vector<int> &order)
{
for (int child : children[node])
visitOrdered(child, children, order);
order.push_back(node);
}
void findUp(int node, vector<int> children[], int parent[], vector<vector<int>> &up, int logN, int depth[])
{
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... |