zoukankan      html  css  js  c++  java
  • C. 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 ab 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.

     

     思路:dfs;

     每个节点只会由他的父亲节点,祖父节点,还有兄弟节点来影响,那么dfs,然后每层从1开始找不是父亲节点,祖父节点,还有兄  弟节值的最小值,复杂度O(n);

     1 #include<iostream>
     2 #include<stdlib.h>
     3 #include<queue>
     4 #include<string.h>
     5 #include<stdio.h>
     6 #include<stack>
     7 #include<vector>
     8 using namespace std;
     9 vector<int>vec[1000000];
    10 int minn = 0;
    11 int ask[1000000];
    12 void dfs(int n,int fa);
    13 int main(void)
    14 {
    15     int n;
    16     scanf("%d",&n);
    17     for(int i = 0; i <n-1; i++)
    18     {
    19         int x,y;
    20         scanf("%d %d",&x,&y);
    21         vec[x].push_back(y);
    22         vec[y].push_back(x);
    23     }ask[1] = 1;
    24     dfs(1,0);
    25     printf("%d
    ",minn);
    26     printf("%d",ask[1]);
    27     for(int i = 2; i <= n; i++)
    28         printf(" %d",ask[i]);
    29     printf("
    ");
    30     return 0;
    31 }
    32 void dfs(int n,int fa)
    33 {
    34     int cnt = 1;
    35     for(int i = 0; i <vec[n].size(); i++)
    36     {
    37         int ic = vec[n][i];
    38         if(ic != fa)
    39         {
    40             while(cnt == ask[fa]||cnt == ask[n])
    41             {
    42                 cnt++;
    43             }
    44 
    45             ask[ic] = cnt++;
    46             dfs(ic,n);
    47         }
    48     }
    49     minn = max(minn,cnt-1);
    50 }
  • 相关阅读:
    ASP.NET WebApi 中使用swagger 构建在线帮助文档
    TortoiseSVN 分支创建与合并
    C# 图片处理
    使用Vue构建单页应用一
    使用nuget 打包并上传 nuget.org
    SignalR 教程二 服务端广播
    SignalR 教程一
    Visual Studio 中常用的快捷键
    EF for Mysql
    Advanced Plugin Concepts
  • 原文地址:https://www.cnblogs.com/zzuli2sjy/p/6516954.html
Copyright © 2011-2022 走看看