# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94299 | Kastanda | Hard route (IZhO17_road) | C++11 | 1149 ms | 102028 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>
#define pb push_back
using namespace std;
const int N = 500005;
int n, D[N], C[N], D2[N], C2[N];
long long Max, cnt;
vector < int > Adj[N];
void DFS(int v, int p)
{
for (int i = 0; i < Adj[v].size(); i++)
if (Adj[v][i] == p)
swap(Adj[v][i], Adj[v].back()),
Adj[v].pop_back();
if (!Adj[v].size())
{
D[v] = 0;
C[v] = 1;
return ;
}
for (int &u : Adj[v])
DFS(u, v), D[v] = max(D[v], D[u] + 1);
for (int &u : Adj[v])
if (D[v] == D[u] + 1)
C[v] += C[u];
}
void DFS2(int v, int p)
{
int Mxd[2] = {D2[v], -1};
int Cnt[2] = {0 , 0};
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... |