1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
vector<int >g[10005];
int a[105][10005];
int n,m;
void dfs(int u,int pa,int d){
    a[u][m]=d;
    int pp=g[u].size();
    int f=0;
    for(int i=0;i<pp;i++){
        if(g[u][i]!=pa){
            if(f==0){
                for(int j=0;j<m;j++){
                    a[g[u][i]][j]=a[u][j];
                }
                dfs(g[u][i],u,d+1);
                f++;
            }
            else{
                for(int j=0;j<=m;j++){
                    a[g[u][i]][j]=a[u][j];
                }
                m++;
                dfs(g[u][i],u,1);
            }
        }
    }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX