UVa11153 - Museums

Problem F : Museums
Time limit: 10 seconds

---

• Museums have been playing a very important role in the development of art and culture in various places around the world. Museums acquire, conserve, research, communicate and exhibit, for purposes of study, education and enjoyment, material evidence of people and their environment...

- Museums Guide Book, LCSD, 2003

---

You are on holiday, and being a culture lover, you decide to visit some museums this afternoon. You have the Museums Guide Book on hand, in which details of all museums are included. To each museum you have also assigned a "fun index", ranging from 1 to 9, describing how interesting it is.

Everything seems fine except that you have a pretty low budget, as you need to save up money to buy manga books. What's worse, the time you can use is also limited, thus you may not be able to visit all museums. As a result, you will need to plan your trip carefully such that the "fun" you can get is maximized, i.e. the total "fun index" of all places you visit is the greatest.

Here are some guidelines for your planning. Firstly, since you will travel in your car, you will assume the transport cost to be $0. Secondly, you will need to spend at least 15 minutes at the museum for each visit - you've really got to look at the exhibits! Thirdly, you should not visit any museum more than once, although you may travel past it many times. Last but not least, your trip should start and end both at your home.

You see that planning the trip is a real torture to your mind, so you need to write a program that helps you with it. Given the details of all museums and roads as well as the restrictions on money and time, your program should find the maximum "fun" you can get.

Input

Input consists of several test cases. The first line of the input file gives the number of cases.

The first line of each case gives four positive integers d, t, n and m. d is the amount of money you can spend (in dollars), which will not exceed 100. t is the time limit for your trip (in minutes), which can be up to 600. n gives the number of museums in your list, which will always be less than 13. Finally, m is the number of roads, which has a upper limit of n (n+1) / 2.

Next comes n lines, each with two integers specifying the admission fee (in dollars, not greater than 50) and "fun index" of a museum.

Each of the following m lines of the input has three integers i, j and k, which means that a bidirectional road connects nodes i and j, and it takes k (≤ 200) minutes for your car to go through it. In this problem we define node 0 as the position of your home, and node i as the i-th museum in your above list. Please note that some (but not all) museums might NOT be reachable from your home at all, so be careful. Moreover, no roads will connect a node to itself, but there might be more than one road between two nodes.

Output

For each test case, your program should output the maximum fun you can get. If you cannot visit any museum at all, output "No possible trip." instead.

Sample Input

2
50 120 4 4
15 8
5 4
0 2
15 5
0 1 3
0 4 8
1 3 5
2 4 70
50 2 4 4
15 8
5 4
0 2
15 5
0 1 3
0 4 8
1 3 5
2 4 70

Sample Output

Case 1: 15
Case 2: No possible trip.

dp[pos][mask] 表示的是目前在位置pos而且已经游览了mask经典的 最少时间.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int inf = 1e9;
struct muse{
    int fee;
    int fun;
    muse(int fee=0,int fun = 0):fee(fee),fun(fun){}
};
vector<muse> vmu;
int ti,mo,n,m,ans;
int dp[14][1<<14];
int path[14][14];
void init(){
    ans = 0;
    vmu.clear();
    vmu.resize(n);
    for(int i = 0; i < n; i++){
        path[i][i] = 0;
        for(int j = i+1; j < n; j++){
            path[i][j] = path[j][i] = inf;
        }
    }
}
void solve(){
      for(int mask = 2; mask < (1<<n); mask++)
                for(int pos = 0; pos < n;  pos++){
                    dp[pos][mask] = inf;
                    for(int i= 1; i < n; i++){
                        if(mask&(1<<i))
                            dp[pos][mask] = min(dp[pos][mask],dp[i][mask^(1<<i)]+path[pos][i]);
                    }
                }

    for(int mask = 0; mask < (1<<n); mask++){
        int t = dp[0][mask],m = 0,f=0;
        for(int i = 1; i < n; i++){
            if((1<<i)&mask){
                t += 15;
                m += vmu[i].fee;
                f += vmu[i].fun;
            }
            if(m >mo||t>ti) break;
        }
        if(m > mo || t > ti) continue;
        ans = max(ans,f);
    }
    if(ans == 0) printf("No possible trip.\n");
    else cout<<ans<<endl;

}
void input(){
     for(int i = 1; i < n; i++) cin >> vmu[i].fee >> vmu[i].fun;
    while(m--){
        int a,b,c;
        cin >> a >> b >> c;
        if(path[a][b] > c) path[a][b] = path[b][a] =c;
    }
    for(int k = 0; k < n; k++)
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++)
                path[i][j]  = min(path[i][k]+path[k][j],path[i][j]);

    for(int i = 0; i < n; i++)  dp[i][0] = dp[i][1]= path[i][0];

}
int main(){

    int ncase,T=1;
    cin >> ncase;
    while(ncase--){
            cin >> mo >> ti >> n >> m;
            n++;
            init();
            input();
            printf("Case %d: ",T++);
            solve();
    }
    return 0;
}