# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729020 | MilosMilutinovic | Tourism (JOI23_tourism) | C++14 | 875 ms | 24912 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;
int n,m,q,c[100005],sz[100005],dep[100005];
vector<int> g[100005];
vector<pair<int,int>> qs[100005];
int son[100005],head[100005],pos[100005],pv,pr[100005];
int ans[100005];
void dfs(int x,int fa)
{
sz[x]=1;pr[x]=fa;
dep[x]=dep[fa]+1;
int mx=0;
for(int y:g[x])
{
if(y==fa) continue;
dfs(y,x);sz[x]+=sz[y];
if(sz[y]>mx)mx=sz[y],son[x]=y;
}
}
void build(int x,int fa,int c)
{
head[x]=c;pos[x]=++pv;
if(son[x])build(son[x],x,c);
for(int y:g[x])
if(y!=fa&&y!=son[x])
build(y,x,y);
}
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... |