HDU 4571 Travel in time（最短路径+DP）（2013 ACM-ICPC长沙赛区全国邀请赛）

Problem Description

　　Bob gets tired of playing games, leaves Alice, and travels to Changsha alone. Yuelu Mountain, Orange Island, Window of the World, the Provincial Museum etc...are scenic spots Bob wants to visit. However, his time is very limited, he can’t visit them all. 
　　Assuming that there are N scenic spots in Changsha, Bob defines a satisfaction value Si to each spot. If he visits this spot, his total satisfaction value will plus Si. Bob hopes that within the limited time T, he can start at spot S, visit some spots selectively, and finally stop at spot E, so that the total satisfaction value can be as large as possible. It's obvious that visiting the spot will also cost some time, suppose that it takes C_i units of time to visit spot i ( 0 <= i < N ).
　　Always remember, Bob can choose to pass by a spot without visiting it (including S and E), maybe he just want to walk shorter distance for saving time. 
　　Bob also has a special need which is that he will only visit the spot whose satisfaction value is strictly larger than that of which he visited last time. For example, if he has visited a spot whose satisfaction value is 50, he would only visit spot whose satisfaction value is 51 or more then. The paths between the spots are bi-directional, of course.

 

Input

　　The first line is an integer W, which is the number of testing cases, and the W sets of data are following.
　　The first line of each test data contains five integers: N M T S E. N represents the number of spots, 1 < N < 100; M represents the number of paths, 0 < M < 1000; T represents the time limitation, 0 < T <= 300; S means the spot Bob starts from. E indicates the end spot. (0 <= S, E < N)
　　The second line of the test data contains N integers C_i ( 0 <= C_i <= T ), which means the cost of time if Bob visits the spot i.
　　The third line also has N integers, which means the satisfaction value Si that can be obtained by visiting the spot i ( 0 <= S_i < 100 ).
　　The next M lines, each line contains three integers u v L, means there is a bi-directional path between spot u and v and it takes L units of time to walk from u to v or from v to u. (0 <= u, v < N, 0 <= L <= T)

 

Output

　　Output case number in the first line (formatted as the sample output).
　　The second line contains an integer, which is the greatest satisfaction value.
If Bob can’t reach spot E in T units of time, you should output just a “0” (without quotation marks).

 

题目大意：有n个点m条无向边，每个点有一个权值和一个花费，每条边有一个花费。现在要从S走到E，允许的最大花费为T。经过一个点的时候可以获得它的权值，但同时也要经受那个点的花费，但每次获得的点权要比上一次或者的点券要大。每个点每条边都可以重复走。问从S走到E能获得的最大点权是多少。

思路：搜素超时无误>_<，正解为DP。先作一次floyd求出每个点之间的距离（因为要用到的点点间距太多了floyd正合适，虽说边少可以用SPFA很快，不过n只有100随便啦），然后重新建一个图，从点权小的点 i 到点权大的点 j 之间连一条边，花费为从 i 到 j 的最短路径。得到的图是一个DAG可以用来做DP。DP[i][j]表示到达第i个点并参观，总花费为j，能获得的最大点权，按拓扑结构的顺序来做DP即可。答案为max{DP[i][j - mat[i][E]]}（可以认为我们呆在一个点不动直到做下一个动作，也就是呆着直到要不够时间到终点了）

PS：有重边要注意（原来不说就是有重边啊……）

PS2：记得输出那个Case啊我就忘了……

PS3：细节看代码，要注意不能到达终点的情况和能到终点权值却为0的情况。

PS4：为了方便做DP我加入了一个附加源点←_←

PS5：同一份题有两条最短路+DP大丈夫？虽说用的最短路和DP都不一样……

 

代码（843MS）：

 #include <cstdio>
 #include <iostream>
 #include <cstring>
 #include <queue>
 using namespace std;
 typedef long long LL;

 const int MAXN = ;
 const int MAXE = MAXN * MAXN;

 int n, m, st, ed, T;
 int val[MAXN], vis_c[MAXN];
 int mat[MAXN][MAXN];

 inline void update_min(int &a, const int &b) {
     if(a > b) a = b;
 }

 inline void update_max(int &a, const int &b) {
     if(a < b) a = b;
 }

 struct Solve {
     int head[MAXN], indeg[MAXN];
     int to[MAXE], next[MAXE], cost[MAXE];
     int ecnt;

     void init() {
         memset(head, , sizeof(head));
         memset(indeg, , sizeof(indeg));
         ecnt = ;
     }

     void add_edge(int u, int v, int c) {
         ++indeg[v];
         to[ecnt] = v; cost[ecnt] = c; next[ecnt] = head[u]; head[u] = ecnt++;
     }

     int dp[MAXN][MAXN * ];

     int solve() {
         memset(dp, -, sizeof(dp));
         dp[n][] = ;
         queue<int> que; que.push(n);
         while(!que.empty()) {
             int u = que.front(); que.pop();
             for(int i = ; i <= T; ++i) update_max(dp[u][i], dp[u][i - ]);
             for(int p = head[u]; p; p = next[p]) {
                 int &v = to[p];
                 for(int i = ; i <= T - cost[p]; ++i) {
                     if(dp[u][i] == -) continue;
                     update_max(dp[v][i + cost[p]], dp[u][i] + val[v]);
                 }
                 if(--indeg[v] == ) que.push(v);
             }
         }
         int ans = ;
         mat[n][ed] = mat[st][ed];
         for(int i = ; i <= n; ++i) if(T - mat[i][ed] >= )
             update_max(ans, dp[i][T - mat[i][ed]]);
         //printdp();
         return ans;
     }

     void printdp() {
         for(int i = ; i < n; ++i) {
             for(int j = ; j <= T; ++j) printf("%d ", dp[i][j]);
             printf("\n");
         }
     }

 } G;

 struct Original {
     void read() {
         memset(mat, 0x3f, sizeof(mat));
         for(int i = ; i < n; ++i) mat[i][i] = ;
         int u, v, c;
         for(int i = ; i < m; ++i) {
             scanf("%d%d%d", &u, &v, &c);
             update_min(mat[u][v], c);
             update_min(mat[v][u], c);
         }
     }

     void floyd() {
         for(int k = ; k < n; ++k)
             for(int i = ; i < n; ++i)
                 for(int j = ; j < n; ++j) update_min(mat[i][j], mat[i][k] + mat[k][j]);
     }

     bool make_G() {
         floyd();
         if(mat[st][ed] > T) return false;
         G.init();
         for(int i = ; i < n; ++i)
             for(int j = ; j < n; ++j)
                 if(val[i] < val[j]) G.add_edge(i, j, mat[i][j] + vis_c[j]);
         for(int i = ; i < n; ++i)
             G.add_edge(n, i, mat[st][i] + vis_c[i]);
         return true;
     }
 } O;

 int main() {
     int W;
     scanf("%d", &W);
     for(int w = ; w <= W; ++w) {
         scanf("%d%d%d%d%d", &n, &m, &T, &st, &ed);
         for(int i = ; i < n; ++i) scanf("%d", &vis_c[i]);
         for(int i = ; i < n; ++i) scanf("%d", &val[i]);
         O.read();
         O.make_G();
         printf("Case #%d:\n%d\n", w, G.solve());
     }
 }