zoukankan      html  css  js  c++  java
  • POJ 2378 Tree Cutting

    Tree Cutting

    Time Limit: 1000ms
    Memory Limit: 65536KB
    This problem will be judged on PKU. Original ID: 2378
    64-bit integer IO format: %lld      Java class name: Main
     
    After Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 <= N <= 10,000) barns at an incredible cost, he sued Bessie to mitigate his losses. 

    Bessie, feeling vindictive, decided to sabotage Farmer John's network by cutting power to one of the barns (thereby disrupting all the connections involving that barn). When Bessie does this, it breaks the network into smaller pieces, each of which retains full connectivity within itself. In order to be as disruptive as possible, Bessie wants to make sure that each of these pieces connects together no more than half the barns on FJ. 

    Please help Bessie determine all of the barns that would be suitable to disconnect.
     

    Input

    * Line 1: A single integer, N. The barns are numbered 1..N. 

    * Lines 2..N: Each line contains two integers X and Y and represents a connection between barns X and Y.
     

    Output

    * Lines 1..?: Each line contains a single integer, the number (from 1..N) of a barn whose removal splits the network into pieces each having at most half the original number of barns. Output the barns in increasing numerical order. If there are no suitable barns, the output should be a single line containing the word "NONE".
     

    Sample Input

    10
    1 2
    2 3
    3 4
    4 5
    6 7
    7 8
    8 9
    9 10
    3 8

    Sample Output

    3
    8

    Hint

    INPUT DETAILS: 

    The set of connections in the input describes a "tree": it connects all the barns together and contains no cycles. 

    OUTPUT DETAILS: 

    If barn 3 or barn 8 is removed, then the remaining network will have one piece consisting of 5 barns and two pieces containing 2 barns. If any other barn is removed then at least one of the remaining pieces has size at least 6 (which is more than half of the original number of barns, 5).
     

    Source

     
    解题:树形dp
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <vector>
     5 #include <algorithm>
     6 using namespace std;
     7 const int maxn = 10010;
     8 vector<int>g[maxn],ans;
     9 int n,m,son[maxn];
    10 void dfs(int u,int fa){
    11     son[u] = 1;
    12     int maxson = 0;
    13     for(int i = g[u].size()-1; i >= 0; --i){
    14         if(g[u][i] == fa) continue;
    15         dfs(g[u][i],u);
    16         maxson = max(maxson,son[g[u][i]]);
    17         son[u] += son[g[u][i]];
    18     }
    19     maxson = max(maxson,n - son[u]);
    20     if(maxson <= (n>>1)) ans.push_back(u);
    21 }
    22 int main(){
    23     int u,v;
    24     while(~scanf("%d",&n)){
    25         for(int i = 0; i <= n; ++i) g[i].clear();
    26         for(int i = 1; i < n; ++i){
    27             scanf("%d%d",&u,&v);
    28             g[u].push_back(v);
    29             g[v].push_back(u);
    30         }
    31         ans.clear();
    32         dfs(1,-1);
    33         if(ans.size()){
    34             sort(ans.begin(),ans.end());
    35             for(int i = 0; i < ans.size(); ++i)
    36                 printf("%d
    ",ans[i]);
    37         }else puts("NONE");
    38     }
    39     return 0;
    40 }
    View Code
  • 相关阅读:
    15.接口
    14.抽象类
    13.系统总结static
    免费的Lucene 原理与代码分析完整版下载
    CODE大全浅谈谷歌adsense与PIN码
    CSDN社区投诉申请表
    Koa框架教程,Koa框架开发指南,Koa框架中文使用手册,Koa框架中文文档
    CODE大全告诉你java是否开始没落了
    Jsoup教程jsoup开发指南,jsoup中文使用手册,jsoup中文文档
    CODE大全——机器学习
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4797914.html
Copyright © 2011-2022 走看看