# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254132 | rama_pang | Tax Evasion (LMIO19_mokesciai) | C++14 | 303 ms | 70136 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;
using lint = long long;
const int MAXN = 200005;
const int INF = 1e8;
int N, M;
int A[MAXN];
vector<int> adj[MAXN];
int depth[MAXN];
int lift[MAXN][20];
void DfsInit(int u) {
for (int j = 1; j < 20; j++) {
lift[u][j] = lift[lift[u][j - 1]][j - 1];
}
for (auto v : adj[u]) {
lift[v][0] = u;
depth[v] = depth[u] + 1;
DfsInit(v);
}
}
int dp[MAXN];
multiset<int> leaf[MAXN];
void Dfs(int u) {
dp[u] = INF;
# | 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... |