zoukankan      html  css  js  c++  java
  • hdu 1520

    Anniversary party

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 6401    Accepted Submission(s): 2862


    Problem Description
    There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tree rooted at the rector V. E. Tretyakov. In order to make the party funny for every one, the rector does not want both an employee and his or her immediate supervisor to be present. The personnel office has evaluated conviviality of each employee, so everyone has some number (rating) attached to him or her. Your task is to make a list of guests with the maximal possible sum of guests' conviviality ratings.
     
    Input
    Employees are numbered from 1 to N. A first line of input contains a number N. 1 <= N <= 6 000. Each of the subsequent N lines contains the conviviality rating of the corresponding employee. Conviviality rating is an integer number in a range from -128 to 127. After that go T lines that describe a supervisor relation tree. Each line of the tree specification has the form:
    L K
    It means that the K-th employee is an immediate supervisor of the L-th employee. Input is ended with the line
    0 0
     
    Output
    Output should contain the maximal sum of guests' ratings.
     
    Sample Input
    7 1 1 1 1 1 1 1 1 3 2 3 6 4 7 4 4 5 3 5 0 0
     
    Sample Output
    5
     
    Source
     
    基础树形dp
    每个点的子节点用vector保存下来;
    d[i][0] 表示不选择此节点的最大值
    d[i][1] 表示不选择此节点的最大值
    d[root][0] += max(d[v[root][i]][1], d[v[root][i]][0]); 
    d[root][1] += d[v[root][i]][0];
    #include <cstdio>
    #include <iostream>
    #include <sstream>
    #include <cmath>
    #include <cstring>
    #include <cstdlib>
    #include <string>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <algorithm>
    using namespace std;
    #define ll long long
    #define _cle(m, a) memset(m, a, sizeof(m))
    #define repu(i, a, b) for(int i = a; i < b; i++)
    #define repd(i, a, b) for(int i = b; i >= a; i--)
    #define sfi(n) scanf("%d", &n)
    #define sfl(n) scanf("%lld", &n)
    #define pfi(n) printf("%d
    ", n)
    #define pfl(n) printf("%lld
    ", n)
    #define MAXN 6005
    int w[MAXN];
    bool f[MAXN] = {false};
    vector<int> v[MAXN];
    int d[MAXN][2];
    bool vis[MAXN] = {false};
    void dp(int root)
    {
        if(vis[root]) return ;
        vis[root] = true;
        int siz = v[root].size();
        repu(i, 0, siz) dp(v[root][i]);
    
        repu(i, 0, siz)
        {
            d[root][0] += max(d[v[root][i]][1], d[v[root][i]][0]);
            d[root][1] += d[v[root][i]][0];
        }
        return ;
    }
    int main()
    {
        int n;
        while(~sfi(n))
        {
            _cle(vis, false);
            _cle(f, false);
            repu(i, 1, n + 1)
            {
                sfi(w[i]);
                v[i].clear();
                d[i][0] = 0;
                d[i][1] = w[i];
            }
            int x, y;
            while(sfi(x), sfi(y), x + y)
            {
                v[y].push_back(x);
                f[x] = true;
            }
            int root;
            repu(i, 1, n + 1) if(!f[i])
            {
                root = i;
                break;
            }
            dp(root);
            pfi(max(d[root][0], d[root][1]));
            //repu(i, 1, n + 1) printf("%d %d
    ", d[i][0], d[i][1]);
        }
    
        return 0;
    }
    View Code
     
  • 相关阅读:
    ROS入门笔记(三):二进制包与源代码包
    zsh 使用通配符功能
    Linux显示行号设置
    Linux、Ubuntu、CentOS安装和配置zsh
    Python中出现 SyntaxError: (unicode error) 'unicodeescape' codec can't decode bytes in position 12-13: truncated UXXXXXXXX escape
    Python数据分析:pandas玩转Excel(三)
    【WP8】ScrollViewer滑动到底触发器(ListBox失效)
    【WP8】扩展CM的INavigationService方法
    【WP8】仿QQ提示消息
    【WP8】键盘弹出时控制Frame位置
  • 原文地址:https://www.cnblogs.com/sunus/p/4681051.html
Copyright © 2011-2022 走看看