zoukankan      html  css  js  c++  java
  • HDU 多校1.3

    Colorful Tree

    Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
    Total Submission(s): 0    Accepted Submission(s): 0


    Problem Description
    There is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci .

    The path between each two different nodes is unique, of which we define the value as the number of different colors appearing in it.

    Calculate the sum of values of all paths on the tree that has n(n1)2 paths in total.
     
    Input
    The input contains multiple test cases.

    For each test case, the first line contains one positive integers n , indicating the number of node. (2n200000)

    Next line contains n integers where the i -th integer represents ci , the color of node i . (1cin)

    Each of the next n1 lines contains two positive integers x,y (1x,yn,xy) , meaning an edge between node x and node y .

    It is guaranteed that these edges form a tree.
     
    Output
    For each test case, output "Case #x : y " in one line (without quotes), where x indicates the case number starting from 1 and y denotes the answer of corresponding case.
     
    Sample Input
    3 1 2 1 1 2 2 3 6 1 2 1 3 2 1 1 2 1 3 2 4 2 5 3 6
     
    Sample Output
    Case #1: 6 Case #2: 29
  • 相关阅读:
    一周内签到连续天数求解
    int型动态数组总结
    快速排序总结
    希尔排序总结
    冒泡排序的总结
    桶排序总结
    插入排序的总结
    选择排序的总结
    二分法的五种实现
    安装Yum源
  • 原文地址:https://www.cnblogs.com/Roni-i/p/7233425.html
Copyright © 2011-2022 走看看