# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993539 | doducanh | Hard route (IZhO17_road) | C++14 | 414 ms | 136256 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;
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
const int maxn=5e5+7;
vector<int>adj[maxn];
int max_depth[maxn];
int max_count[maxn];
int max_hardness=0;
int paths_counts=1;
int n;
void dfs(int u,int par)
{
for(int v:adj[u])if(v!=par){
dfs(v,u);
if(max_depth[u]<max_depth[v]+1){
max_depth[u]=max_depth[v]+1;
max_count[u]=max_count[v];
}
else if(max_depth[u]==max_depth[v]+1){
max_count[u]+=max_count[v];
}
}
}
void dfs2(int u,int par,int parent_dist,int parent_count)
{
// cout<<u<<" "<<max_hardness<<" "<<paths_counts<<" ";
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... |