Codeforces 782C. 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!
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.
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.
3
2 3
1 3
3
1 3 2
5
2 3
5 3
4 3
1 3
5
1 3 2 5 4
5
2 1
3 2
4 3
5 4
3
1 2 3 1 2
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.
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
const int MAXN=2e5+,INF=0x3f3f3f3f,MOD=1e9+;
int n,col[MAXN];
map<int,vector<int> >G;
int ans;
dfs(int now,int sign,int fa,int flag)
{
//cout<<now<<" "<<sign<<" "<<fa<<" "<<flag<<endl;
int tmp=;
for(int i=; i<G[now].size(); i++)
{
int to=G[now][i];
if(to==fa) continue;
while(++tmp)
{
if(tmp!=sign&&tmp!=flag)
{
col[to]=tmp;
if(tmp>ans) ans=tmp;
dfs(to,tmp,now,sign);
break;
}
}
}
}
int main()
{
scanf("%d",&n);
for(int i=; i<n; i++)
{
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
col[]=;
ans=;
dfs(,,-,-);
cout<<ans<<endl;
for(int i=; i<=n; i++) cout<<col[i]<<" ";
cout<<endl;
return ;
}
搜索
最新文章
- javascript超过容器后显示省略号效果(兼容一行或者多行)
- C#使用quartz.net定时问题
- 开源IM工程“蘑菇街TeamTalk”的现状:一场有始无终的开源秀
- CMD.EXE中dir超长字符串缓冲区溢出原理学习
- 为阿里云存储开发的PHP PEAR 包:Services_Aliyun_OSS
- php empty()和isset()的区别
- 使用Webdriver执行JS小结
- java多线程编程(二创建线程)
- 信号之sigsuspend函数
- js自执行函数表达式
- C++笔记002:VS2010报错:LINK fatal error LNK1123 转换到 COFF 期间失败文件无效或损坏
- 关于在html中直接引入less文件遇到的小问题
- JavaScript基础视频教程总结(131-140章)
- 牛客网-2018年湘潭大学程序设计竞赛-F
- vs2010下使用sqlite
- leetcode124
- postgresql ltree类型
- Linux系统下公式编辑器KLatexFormula
- [整理]zepto的初次使用
- HDUOJ-----1098 Ignatius&#39;s puzzle