hdu 4049 Tourism Planning [ 状压dp ]

传送门

Tourism Planning

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1115    Accepted Submission(s): 482

Problem Description

Several friends are planning to take tourism during the next holiday. They have selected some places to visit. They have decided which place to start their tourism and in which order to visit these places. However, anyone can leave halfway during the tourism and will never back to the tourism again if he or she is not interested in the following places. And anyone can choose not to attend the tourism if he or she is not interested in any of the places.
Each place they visited will cost every person certain amount of money. And each person has a positive value for each place, representing his or her interest in this place. To make things more complicated, if two friends visited a place together, they will get a non negative bonus because they enjoyed each other’s companion. If more than two friends visited a place together, the total bonus will be the sum of each pair of friends’ bonuses.
Your task is to decide which people should take the tourism and when each of them should leave so that the sum of the interest plus the sum of the bonuses minus the total costs is the largest. If you can’t find a plan that have a result larger than 0, just tell them to STAY HOME.

 

 

Input

There are several cases. Each case starts with a line containing two numbers N and M ( 1<=N<=10, 1<=M<=10). N is the number of friends and M is the number of places. The next line will contain M integers Pi (1<=i<=M) , 1<=Pi<=1000, representing how much it costs for one person to visit the ith place. Then N line follows, and each line contains M integers Vij (1<=i<=N, 1<=j<=M), 1<=Vij<=1000, representing how much the ith person is interested in the jth place. Then N line follows, and each line contains N integers Bij (1<=i<=N, 1<=j<=N), 0<=Bij<=1000, Bij=0 if i=j, Bij=Bji.
A case starting with 0 0 indicates the end of input and you needn’t give an output.

 

 

Output

For each case, if you can arrange a plan lead to a positive result, output the result in one line, otherwise, output STAY HOME in one line.

 

 

Sample Input

2 1 10 15 5 0 5 5 0 3 2 30 50 24 48 40 70 35 20 0 4 1 4 0 5 1 5 0 2 2 100 100 50 50 50 50 0 20 20 0 0 0

 

 

Sample Output

5 41 STAY HOME

 

 

Source

The 36th ACM/ICPC Asia Regional Beijing Site —— Online Contest

 

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  4041 4043 4050 4044 4045 

 

 

 

13075053

2015-03-09 18:32:49

Accepted

4049

405MS

2120K

3076 B

G++

czy

 

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#define N 15

using namespace std;

int n,m;
int p[N];
int v[N][N];
int b[N][N];
int dp[N][ (1<<10) ];
int ans;
int tot;
int happy[N][ (1<<10) ];

vector<int> can[ (1<<10) ];

int cal(int i,int o);
int ok(int k,int o);

void ini()
{
    int i,j;
    ans=0;
    memset(dp,0,sizeof(dp));
    for(i=1;i<=m;i++){
        scanf("%d",&p[i]);
    }
    for(i=0;i<n;i++){
        for(j=1;j<=m;j++){
            scanf("%d",&v[i][j]);
        }
    }
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            scanf("%d",&b[i][j]);
        }
    }
    int o;
    tot = (1<<n);
    for(i=1;i<=m;i++){
        for(o=0;o<tot;o++){
            dp[i][o]=-1000000000;
        }
    }
    //printf("  n=%d m=%d tot=%d\n",n,m,tot );
    for(i=1;i<=m;i++){
        for(o=0;o<tot;o++){
            happy[i][o]=cal(i,o);
        }
    }

    for(o=0;o<tot;o++){
        can[o].clear();
        for(int k=0;k<tot;k++){
            if(ok(k,o)==1){
                can[o].push_back(k);
            }
        }
    }
}

int cal(int i,int o)
{
    int re=0;
    int j,k;
    int cc=0;
    //printf("  i=%d o=%d\n",i,o );
    for(j=0;j<n;j++){
        if( (1<<j) & o ){
            cc++;
            re+=v[j][i];
        }
    }
    //printf(" 1   re=%d\n",re );
    for(j=0;j<n;j++){
        if( (1<<j) & o ){
            for(k=j+1;k<n;k++){
                if( (1<<k) & o ){
                    re += b[j][k];
                }
            }
        }
    }
    // printf("  2  re=%d\n",re );
    re -= p[i]*cc;
     //printf("   3 re=%d\n",re );
    //printf("  i=%d o=%d re=%d\n",i,o,re );
    return re;
}

int ok(int k,int o){
    int j;
    for(j=0;j<n;j++){
       // printf("    j=%d\n",j );
        if( (1<<j) & o ){
            if(  (  (1<<j) &k ) ==0 ){
                return 0;
            }
        }
    }
    return 1;
}

void solve()
{
    int o,j,i,k;
    int te;
    for(i=1;i<=m;i++){
        //printf("  i=%d\n",i );
        for(o=0;o<tot;o++){
           // printf("   o=%d\n", o);
            for(vector<int>::iterator it =can[o].begin();it != can[o].end();it++){
           // for(k=0;k<tot;k++){
                 //printf("   k=%d\n", k);
                k=*it;
               // if(ok(k,o)==0) continue;
                
                //te=cal(i,o);
                te=happy[i][o];
                dp[i][o]=max(dp[i][o],dp[i-1][k]+te);
                //printf("    i=%d o=%d dp=%d\n", i,o,dp[i][o]);
            }  
        }
    }

    i=m;
    for(o=0;o<tot;o++){
        //printf("  o=%d dp=%d\n",o,dp[m][o] );
        ans=max(ans,dp[m][o]);
    }
}

void out()
{
    if(ans<=0){
        printf("STAY HOME\n");
    }
    else{
        printf("%d\n", ans);
    }
}

int main()
{
    while(scanf("%d%d",&n,&m)!=EOF){
        if(n==0 && m==0) break;
        ini();
        solve();
        out();
    }
}