# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472902 | soba | Railway (BOI17_railway) | C++14 | 400 ms | 64032 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;
typedef long long ll;
int n, l, m , k;
vector<int> adj[100005];
int nodes[100005];
int parent[100005] , level[100005] , sz[100005], sol[100005];
int timer;
vector<int> tin, tout;
vector<vector<int>> up;
set<int>st[100005], en[100005];
void dfs(int v, int p, int lvl)
{
sz[v]++;
level[v]=lvl;
parent[v]=p;
tin[v] = ++timer;
up[v][0] = p;
for (int i = 1; i <= l; ++i)
up[v][i] = up[up[v][i-1]][i-1];
for (int u : adj[v]) {
if (u != p)
{
dfs(u, v , lvl+1);
sz[v]+=sz[u];
}
}
tout[v] = ++timer;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |