zoukankan      html  css  js  c++  java
  • hdu 3535 AreYouBusy 分组背包

    AreYouBusy

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)


    Problem Description
    Happy New Term!
    As having become a junior, xiaoA recognizes that there is not much time for her to AC problems, because there are some other things for her to do, which makes her nearly mad.
    What's more, her boss tells her that for some sets of duties, she must choose at least one job to do, but for some sets of things, she can only choose at most one to do, which is meaningless to the boss. And for others, she can do of her will. We just define the things that she can choose as "jobs". A job takes time , and gives xiaoA some points of happiness (which means that she is always willing to do the jobs).So can you choose the best sets of them to give her the maximum points of happiness and also to be a good junior(which means that she should follow the boss's advice)?
     
    Input
    There are several test cases, each test case begins with two integers n and T (0<=n,T<=100) , n sets of jobs for you to choose and T minutes for her to do them. Follows are n sets of description, each of which starts with two integers m and s (0<m<=100), there are m jobs in this set , and the set type is s, (0 stands for the sets that should choose at least 1 job to do, 1 for the sets that should choose at most 1 , and 2 for the one you can choose freely).then m pairs of integers ci,gi follows (0<=ci,gi<=100), means the ith job cost ci minutes to finish and gi points of happiness can be gained by finishing it. One job can be done only once.
     
    Output
    One line for each test case contains the maximum points of happiness we can choose from all jobs .if she can’t finish what her boss want, just output -1 .
     
    Sample Input
    3 3 2 1 2 5 3 8 2 0 1 0 2 1 3 2 4 3 2 1 1 1 3 4 2 1 2 5 3 8 2 0 1 1 2 8 3 2 4 4 2 1 1 1 1 1 1 0 2 1 5 3 2 0 1 0 2 1 2 0 2 2 1 1 2 0 3 2 2 1 2 1 1 5 2 8 3 2 3 8 4 9 5 10
     
    Sample Output
    5 13 -1 -1
     
    Author
    hphp
     
    Source
    题意:n个分组,s=0最少取一个,s=1最多取一个,s=2,01背包;
    思路:分组背包;
       s=0,hdu 3033;
       s=1,hdu 1712;
       s=2,01背包;
    #include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define pi (4*atan(1.0))
    #define eps 1e-14
    const int N=1e3+100,M=4e6+10,inf=1e9+10,mod=1e9+7;
    const ll INF=1e18+10;
    int dp[N][N];
    int v[N],w[N];
    // 0 分组最多一个
    // 1 分组最少一个
    // 2 01背包
    int main()
    {
        int n,T;
        while(~scanf("%d%d",&n,&T))
        {
            memset(dp[0],0,sizeof(dp[0]));
            for(int i=1;i<=n;i++)
            {
                int x,flag;
                scanf("%d%d",&x,&flag);
                for(int i=1;i<=x;i++)
                    scanf("%d%d",&v[i],&w[i]);
                if(flag==0)
                {
                    for(int t=0;t<=T;t++)
                    dp[i][t]=-inf;
                    for(int t=1;t<=x;t++)
                    {
                        for(int j=T;j>=v[t];j--)
                        {
                            dp[i][j]=max(dp[i][j],dp[i][j-v[t]]+w[t]);
                            dp[i][j]=max(dp[i][j],dp[i-1][j-v[t]]+w[t]);
                        }
                    }
                }
                else if(flag==1)
                {
                    for(int t=0;t<=T;t++)
                    dp[i][t]=dp[i-1][t];
                    for(int t=1;t<=x;t++)
                    {
                        for(int j=T;j>=v[t];j--)
                        {
                            dp[i][j]=max(dp[i][j],dp[i-1][j-v[t]]+w[t]);
                        }
                    }
                }
                else
                {
                    for(int t=0;t<=T;t++)
                    dp[i][t]=dp[i-1][t];
                    for(int t=1;t<=x;t++)
                    {
                        for(int j=T;j>=v[t];j--)
                        {
                            dp[i][j]=max(dp[i][j],dp[i][j-v[t]]+w[t]);
                            dp[i][j]=max(dp[i][j],dp[i-1][j-v[t]]+w[t]);
                        }
                    }
                }
            }
            if(dp[n][T]>=0)
                printf("%d
    ",dp[n][T]);
            else
                printf("-1
    ");
        }
        return 0;
    }
  • 相关阅读:
    如何看linux是32位还是64位
    Linux下,命令 wget 的使用
    express框架目录结构
    怎么在centos中查看某个目录的树结构?
    CentOS minimal版安装图形界面的步骤(自动获取IP)
    微信小程序项目,实现图书搜索组件完善
    微信小程序项目,实现图书搜索高阶组件:
    微信小程序中使用音频组件以及wx:if和hidden的区别
    微信小程序绑定数据以及自定义指令
    微信小程序定义一个组件
  • 原文地址:https://www.cnblogs.com/jhz033/p/5950853.html
Copyright © 2011-2022 走看看