# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977620 | sleepntsheep | Unique Cities (JOI19_ho_t5) | C11 | 162 ms | 31292 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<stdio.h>
#include<string.h>
#define N 200000
#define N_ (N+1)
int n, m, c[N_], head[N_], vv[N_<<1], nxt[N_<<1], i, u, v, far,dd[N_], rt, orz[N_], oo, hh[N_], longc[N_][2], fr[N_], dist, ans[N_];
void link(int u,int v)
{
static int i=1;
nxt[i]=head[u];
vv[i]=v;
head[u]=i++;
}
void dfs0(int u,int p)
{
dd[u]=dd[p]+1;
if(dd[u]>dd[far])far=u;
for(int j=head[u];j;j=nxt[j])if(vv[j]-p)dfs0(vv[j],u);
}
void dfs1(int u,int p)
{
dd[u]=dd[p]+1;
hh[u]=0;
for(int j=head[u];j;j=nxt[j])if(vv[j]-p)
{
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... |