# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317101 | 8e7 | Balanced Tree (info1cup18_balancedtree) | C++14 | 382 ms | 14584 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 <algorithm>
#include <utility>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define maxn 100005
using namespace std;
const int inf = 8e7;
vector<int> adj[maxn];
int c[maxn];
pii val[maxn];
pii dfs(int n, int par) {
pii ret = make_pair(inf, inf);
for (int v:adj[n]) {
if (v != par) {
pii res = dfs(v, n);
ret.ff = min(ret.ff, res.ff + 1);
ret.ss = min(ret.ss, res.ss + 1);
}
}
val[n] = ret;
if (c[n]) ret.ss = 0;
else ret.ff = 0;
return ret;
}
void dfs2(int n, int par, pii cur) {
val[n].ff = min(val[n].ff, cur.ff);
# | 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... |