CodeForces - 782C Andryusha and Colored Balloons

C. Andryusha and Colored Balloons

time limit per test

 2 seconds

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

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.

Examples

input

3
2 3
1 3

output

3
1 3 2 

input

5
2 3
5 3
4 3
1 3

output

5
1 3 2 5 4 

input

5
2 1
3 2
4 3
5 4

output

3
1 2 3 1 2 

Note

In the first sample the park consists of three squares: 1 → 3 → 2. Thus, the balloon colors have to be distinct.

Illustration for the first sample.

In the second example there are following triples of consequently connected squares:

• 1 → 3 → 2
• 1 → 3 → 4
• 1 → 3 → 5
• 2 → 3 → 4
• 2 → 3 → 5
• 4 → 3 → 5

We can see that each pair of squares is encountered in some triple, so all colors have to be distinct. Illustration for the second sample.

In the third example there are following triples:

• 1 → 2 → 3
• 2 → 3 → 4
• 3 → 4 → 5

We can see that one or two colors is not enough, but there is an answer that uses three colors only. Illustration for the third sample.

2.题意概述：

给你一个连通图，对它进行染色，某节点的颜色和他的相邻节点颜色不能相同，且对于每个父亲，它所有儿子的颜色都不能相同，问你最少需要多少颜色

3.题解：

对于每个结点，通过在每次输入的过程中统计，得到其连接的点的个数并加上1得到的数，比较各个点的该数的最大值，即为我们所需要的最少颜色种类数。建立一个color数组，在DFS过程中给每个点涂色，保证其与父亲结点与祖父结点不同即可。

方法：链式前向星

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include "cmath"
#include "set"
using namespace std;

struct node{
    int to,nex;
}edge[400005];
int color[400005];
int tep[400005];
int head[400005],cnt=1,num,sum;//head[i]代表  以i结点开始的第一条边的下标
void add(int u,int v){
    edge[cnt].to=v;
    edge[cnt].nex=head[u];
    head[u]=cnt++;
}

void dfs(int t,int f){
 int num=1;
    for(int i=head[t];~i;i=edge[i].nex)
 {
        int v=edge[i].to;
        if(v==f||color[v])continue;    //这里的f代指父亲结点，用来防止搜回去
        while(color[t]==num||color[f]==num)
            num++;
        color[v]=num++;
    }
    for(int i=head[t];~i;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v==f)continue;
        dfs(v,t);
    }
}

int main(){
    int n,m,i;
    int mmax=0;
    memset(head,-1,sizeof(head));
    cin>>m;
    for(i=0;i<m-1;i++){
        int x,y;
        cin>>x>>y;
        add(x,y);
        tep[x]++;
        add(y,x);
        tep[y]++;
        mmax=max(mmax,tep[x]);
        mmax=max(mmax,tep[y]);
    }
    sum=mmax;
    color[1]=1;
    dfs(1,0);
    printf("%d\n",mmax+1);
    for(int i=1;i<=m-1;i++)
        printf("%d ",color[i]);
    printf("%d\n",color[m]);
    
    return 0;
}

BFS思路：由于BFS中无法在一次BFS中得到当前点以及当前点的父亲结点与祖父结点分别是多少，故增加一个fcolor数组用来记录该点父亲的颜色；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include "cmath"
#include "set"
#include <queue>
using namespace std;

struct node{
    int to,nex;
}edge[400005];
int color[400005];
int fcolor[400005];
int tep[200005];
int p[400005];
int head[400005],cnt=1,num,sum;//head[i]代表  以i结点开始的第一条边的下标
int vis[400005];
queue<int>tp;
void add(int u,int v){
    edge[cnt].to=v;
    edge[cnt].nex=head[u];
    head[u]=cnt++;
}

int main(){
    int n,m,i;
    int mmax=0;
    memset(head,-1,sizeof(head));
    cin>>m;
    for(i=0;i<m-1;i++){
        int x,y;
        cin>>x>>y;
        add(x,y);
        tep[x]++;
        add(y,x);
        tep[y]++;
        mmax=max(mmax,tep[x]);
        mmax=max(mmax,tep[y]);
    }
    vis[1]=1;
    sum=mmax;
    color[1]=1;
    tp.push(1);
    fcolor[1]=1;
    while(!tp.empty())
    {
        int f=tp.front();
        tp.pop();
        num=1;
        for(int i=head[f];~i;i=edge[i].nex)
        {
         
            int v=edge[i].to;
            fcolor[v]=color[f];
            if(vis[v])
                continue;
            while(num==color[f]||num==fcolor[f])
                num++;
            color[v]=num++;
            vis[v]=1;
            tp.push(v);
        }
    }
    printf("%d\n",mmax+1);
    for(int i=1;i<=m-1;i++)
        printf("%d ",color[i]);
    printf("%d\n",color[m]);
    
    return 0;
}