# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79840 | Pajaraja | Hard route (IZhO17_road) | C++17 | 1951 ms | 172468 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 MAXN 500007
using namespace std;
vector<int> g[MAXN];
int b,mb,u,v,in[MAXN],out[MAXN],c1,c2,n,p[MAXN];
long long pot,cnt,d[MAXN],k[MAXN],ds[2][MAXN];
void dfsD(int s,int f,int di)
{
d[s]=di;
for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfsD(g[s][i],s,di+1);
}
void dfsd(int s,int f,int ka,long long di)
{
ds[ka][s]=di;
for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfsd(g[s][i],s,ka,di+1);
}
int dfsp(int s,int f)
{
int mx=0;
in[c1++]=s;
p[s]=f;
for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) mx=max(mx,dfsp(g[s][i],s));
d[s]=mx+1;
out[c2++]=s;
return d[s];
}
void calc(int s,int f,long long mx,long long du)
{
if(s!=f && g[s].size()==1)
{
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... |