# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200063 | SamAnd | Tax Evasion (LMIO19_mokesciai) | C++17 | 283 ms | 55020 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 N = 200005;
int n, m;
vector<int> a[N];
bool c[N];
int d[N];
int q[N];
vector<int> v;
void dfs(int x)
{
if (v.empty())
d[x] = 1;
else
d[x] = d[v.back()] + 1;
v.push_back(x);
if (c[x])
{
int u = (v.size() / 2) - 1;
++q[v[v.size() - u - 1]];
}
for (int i = 0; i < a[x].size(); ++i)
{
int h = a[x][i];
dfs(h);
}
v.pop_back();
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... |