zoukankan      html  css  js  c++  java
  • HDOJ 5242 Game


    Game

    Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 584    Accepted Submission(s): 170


    Problem Description
    It is well known that Keima Katsuragi is The Capturing God because of his exceptional skills and experience in ''capturing'' virtual girls in gal games. He is able to playk games simultaneously.

    One day he gets a new gal game named ''XX island''. There are n scenes in that game, and one scene will be transformed to different scenes by choosing different options while playing the game. All the scenes form a structure like a rooted tree such that the root is exactly the opening scene while leaves are all the ending scenes. Each scene has a value , and we use wi as the value of the i-th scene. Once Katsuragi entering some new scene, he will get the value of that scene. However, even if Katsuragi enters some scenes for more than once, he will get wi for only once.

    For his outstanding ability in playing gal games, Katsuragi is able to play the game k times simultaneously. Now you are asked to calculate the maximum total value he will get by playing that game for k times.
     

    Input
    The first line contains an integer T(T20), denoting the number of test cases.

    For each test case, the first line contains two numbers n,k(1kn100000), denoting the total number of scenes and the maximum times for Katsuragi to play the game ''XX island''.

    The second line contains n non-negative numbers, separated by space. The i-th number denotes the value of the i-th scene. It is guaranteed that all the values are less than or equal to 2311.

    In the following n1 lines, each line contains two integers a,b(1a,bn), implying we can transform from the a-th scene to the b-th scene.

    We assume the first scene(i.e., the scene with index one) to be the opening scene(i.e., the root of the tree).

     

    Output
    For each test case, output ''Case #t:'' to represent the t-th case, and then output the maximum total value Katsuragi will get.
     

    Sample Input
    2 5 2 4 3 2 1 1 1 2 1 5 2 3 2 4 5 3 4 3 2 1 1 1 2 1 5 2 3 2 4
     

    Sample Output
    Case #1: 10 Case #2: 11
     

    Source
     


    /* ***********************************************
    Author        :CKboss
    Created Time  :2015年06月07日 星期日 16时39分51秒
    File Name     :HDOJ5239.cpp
    ************************************************ */
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <cmath>
    #include <cstdlib>
    #include <vector>
    #include <queue>
    #include <set>
    #include <map>
    
    using namespace std;
    
    typedef long long int LL;
    
    const int maxn=100100;
    
    int n,m;
    
    struct Edge
    {
    	int to,next;
    }edge[maxn*2];
    
    int Adj[maxn],Size;
    
    void init()
    {
    	memset(Adj,-1,sizeof(Adj)); Size=0;
    }
    
    void Add_Edge(int u,int v)
    {
    	edge[Size].next=Adj[u];
    	edge[Size].to=v;
    	Adj[u]=Size++;
    }
    
    LL val[maxn],sumv[maxn];
    priority_queue<LL> q;
    
    LL dfs(int u,int fa)
    {
    	LL pos=0;
    	for(int i=Adj[u];~i;i=edge[i].next)
    	{
    		int v=edge[i].to;
    		if(v==fa) continue;
    		sumv[v]=dfs(v,u);
    		if(sumv[v]>sumv[pos]) pos=v;
    	}
    	for(int i=Adj[u];~i;i=edge[i].next)
    	{
    		int v=edge[i].to;
    		if(v==pos||v==fa) continue;
    		q.push(sumv[v]);
    	}
    	sumv[u]=val[u]+sumv[pos];
    	return sumv[u]; 
    }
    
    int main()
    {
    	//freopen("in.txt","r",stdin);
    	//freopen("out.txt","w",stdout);
        
    	int T_T,cas=1;
    	scanf("%d",&T_T);
    	while(T_T--)
    	{
    		scanf("%d%d",&n,&m);
    		init();
    		for(int i=1;i<=n;i++) 
    		{
    			scanf("%I64d",val+i);
    		}
    		for(int i=0,u,v;i<n-1;i++)
    		{
    			scanf("%d%d",&u,&v);
    			Add_Edge(u,v); Add_Edge(v,u);
    		}
    		while(!q.empty()) q.pop();
    		dfs(1,1);
    		q.push(sumv[1]);
    		LL ans=0;
    		while(!q.empty()&&m--)
    		{
    			ans += q.top();
    			q.pop();
    		}
    
    		printf("Case #%d: %I64d
    ",cas++,ans); 
    	}
    
        return 0;
    }
    


  • 相关阅读:
    编写测试类实现并发访问固定URL(亲测能用!!!)
    java项目添加log4j打印日志+转换系统时间
    springboot项目没错,但就是报红叉
    我想查看数据库名,输入命令:select name from v$database;为什么会说表和视图不存在
    DRUID连接池的实用 配置详解+使用方法+监控方式(太强大了!!!)
    Druid连接池 属性说明
    springBoot2.2.0+mybatis-xml文件方式+Oracle11g+jsp页面,实现简单的CRUD
    s5-12 RIP
    s5-12 RIP
    s5-13 RIP 为什么会 衰败
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/5354288.html
Copyright © 2011-2022 走看看