Codeforces Andryusha and Colored Balloons

Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.

The park consists of n squares connected with (n - 1) bidirectional paths in such a way that any square is reachable from any other using these paths. Andryusha decided to hang a colored balloon at each of the squares. The baloons’ colors are described by positive integers, starting from 1. In order to make the park varicolored, Andryusha wants to choose the colors in a special way. More precisely, he wants to use such colors that if a, b and c are distinct squares that a and b have a direct path between them, and b and c have a direct path between them, then balloon colors on these three squares are distinct.

Andryusha wants to use as little different colors as possible. Help him to choose the colors!

Input
The first line contains single integer n (3 ≤ n ≤ 2·105) — the number of squares in the park.

Each of the next (n - 1) lines contains two integers x and y (1 ≤ x, y ≤ n) — the indices of two squares directly connected by a path.

It is guaranteed that any square is reachable from any other using the paths.

Output
In the first line print single integer k — the minimum number of colors Andryusha has to use.

In the second line print n integers, the i-th of them should be equal to the balloon color on the i-th square. Each of these numbers should be within range from 1 to k.

题意 给定点数和边数，使任意相连的三个点颜色不一样。
dfs：每次把所到点的每条边的点都染上，而且要与上一个点和上上个点颜色不一样即可。

#include <bits/stdc++.h>
using namespace std;
vector<int> v[201000];
int num;
int n;
int c[201000];
void dfs(int x,int f)
{
    int cc=1;
    for(int i=0;i<v[x].size();i++)
    {
        if(v[x][i]!=f)
        {
        while(cc==c[f]||cc==c[x]) cc++;
        c[v[x][i]] = cc++;
    }
    }
    for(int i=0;i<v[x].size();i++) if(v[x][i]!=f) dfs(v[x][i],x);
}
int main()
{
    cin>>n;
    for(int i=1;i<n;i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    c[1]=1;
    num=0;
    dfs(1,0);
    for(int i=1;i<=n;i++)
        num=max(num,c[i]);
    printf("%d\n",num );
    for(int i=1;i<=n;i++)
        printf("%d ",c[i] );
}