题目链接:https://cn.vjudge.net/problem/HDU-4784
题意:有k层,每层n个点,每个点可以选择买,卖,不操作,m条单向边,每条边花费时间和金钱,第i层的j点可以到第(i+1)%k的j点,花费时间为1,不花钱,如果在点1和n的话只能在第0层,从1出发,求到n的最大钱数,到n之后不能在走了。
题解:dp[n][b][k][time] 表示在第k层,第n点,还有b袋,当前时间为time的最大钱数,按照时间bfs跑一遍即可
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
struct edge {
int to, nex, time, money;
}e[210 * 2];
int n, m, B, K, R, T;
int dp[110][6][6][210];
int p[6][110];
int head[110], len;
void add_edge(int x, int y, int time, int money) {
e[len].to = y;
e[len].time = time;
e[len].money = money;
e[len].nex = head[x];
head[x] = len++;
}
struct node {
int to, b, k, time;
node(int to_ = 0, int b_ = 0, int k_ = 0, int time_ = 0) {
to = to_;
b= b_;
k = k_;
time = time_;
}
bool operator <(const node &b) const {
return time > b.time;
}
};
void bfs() {
priority_queue<node> q;
node tmp, now;
int to, money, time, k;
dp[1][0][0][0] = R;
q.push(node(1, 0, 0, 0));
while(!q.empty()) {
now = q.top(); q.pop();
if(now.to == n) continue;
// cout<<now.to<<" "<<now.time<<" "<<now.k<<" "<<now.b<<" "<<dp[now.to][now.b][now.k][now.time]<<": \n";
for(int i = head[now.to]; i != -1; i = e[i].nex) {
to = e[i].to;
if((to == 1 || to == n) && now.k != 0) continue;
money = dp[now.to][now.b][now.k][now.time] - e[i].money;
time = now.time + e[i].time;
if(money < 0 || time > T) continue;
// cout<<to<<" "<<time<<" "<<money<<endl;
if(dp[to][now.b][now.k][time] < money) {
if(dp[to][now.b][now.k][time] == -1) q.push(node(to, now.b, now.k, time));
dp[to][now.b][now.k][time] = money;
}
if(to == 1 || to == n) continue;
if(now.b > 0) {
money = dp[now.to][now.b][now.k][now.time] - e[i].money + p[now.k][to];
if(dp[to][now.b - 1][now.k][time] < money) {
if(dp[to][now.b - 1][now.k][time] == -1) q.push(node(to, now.b - 1, now.k, time));
dp[to][now.b - 1][now.k][time] = money;
}
}
if(now.b < B) {
money = dp[now.to][now.b][now.k][now.time] - e[i].money - p[now.k][to];
if(dp[to][now.b + 1][now.k][time] < money && money >= 0) {
if(dp[to][now.b + 1][now.k][time] == -1) q.push(node(to, now.b + 1, now.k, time));
dp[to][now.b + 1][now.k][time] = money;
}
}
}
if(now.to == 1 || now.to == n) continue;
to=now.to;
k = (now.k + 1) % K;
money = dp[now.to][now.b][now.k][now.time];
time = now.time + 1;
if(money < 0 || time > T) continue;
// cout<<to<<" "<<time<<" "<<money<<endl;
if(dp[to][now.b][k][time] < money) {
if(dp[to][now.b][k][time] == -1) q.push(node(to, now.b, k, time));
dp[to][now.b][k][time] = money;
}
if(now.b > 0) {
money = dp[now.to][now.b][now.k][now.time] + p[k][to];
if(dp[to][now.b - 1][k][time] < money) {
// cout<<to<<" --- "<<now.b-1<<" "<<money<<" "<<time<<endl;
if(dp[to][now.b - 1][k][time] == -1) q.push(node(to, now.b - 1, k, time));
dp[to][now.b - 1][k][time] = money;
}
}
if(now.b < B) {
money = dp[now.to][now.b][now.k][now.time] - p[k][to];
if(dp[to][now.b + 1][k][time] < money && money >= 0) {
// cout<<to<<" --- "<<now.b+1<<" "<<money<<" "<<time<<endl;
if(dp[to][now.b + 1][k][time] == -1) q.push(node(to, now.b + 1, k, time));
dp[to][now.b + 1][k][time] = money;
}
}
}
int ans = -1;
for(int i = 0; i <= T; i++)
for(int j = 0 ; j <= B; j++)
ans = max(ans, dp[n][j][0][i]);
printf(ans == -1?"Forever Alone\n":"%d\n",ans);
}
int main() {
int t, ca = 1;
int x, y, time, money;
scanf("%d", &t);
while(t--) {
memset(dp, -1, sizeof(dp));
memset(head, -1, sizeof(head));
len = 0;
scanf("%d %d %d %d %d %d", &n, &m, &B, &K, &R, &T);
for(int i = 0; i < K; i++)
for(int j = 1; j <= n; j++)
scanf("%d", &p[i][j]);
for(int i = 1; i <= m; i++) {
scanf("%d %d %d %d", &x, &y, &time, &money);
add_edge(x, y, time, money);
// add_edge(y, x, time, money);
}
printf("Case #%d: ", ca++);
bfs();
}
return 0;
}