超级传送门:http://acm.hdu.edu.cn/showproblem.php?pid=3339
思路:先用dijkstra求出基地(0点)到各个发电站的最短路径,统计出电量之和P,则P/2+1就是需要摧毁的最少电量值。然后进行01背包,背包容量是从基地到各个发电站的最短路径的总和,物品就是每条最短路径,其容量为路径长度,价值为该路径终点发电站的电量值。然后即可求出满足给定价值的最小容量,如果均不满足,则输出“impossible”。
代码如下:
#include<stdio.h>
#include<string.h>
#define N 105
#define INF 100000000
#define smax(a,b) ((a>b)?a:b)
int n,m,p_tot,w_tot;
int w[N][N],d[N],p[N],vis[N],dp[1000000];
void dijkstra();
void ZeroOneDP();
int main () {
int t,i,j,a,b,c,ok;
scanf("%d",&t);
while (t--) {
scanf("%d%d",&n,&m);
for (i=0;i<=n;i++)
for (j=i;j<=n;j++)
w[i][j] = w[j][i] = (i==j)?0:INF;
memset(p,0,sizeof(p));
memset(vis,0,sizeof(vis));
memset(dp,0,sizeof(dp));
w_tot = p_tot = 0;
for (i=1;i<=m;i++) {
scanf("%d%d%d",&a,&b,&c);
if (w[a][b]>c) {
w[a][b] = w[b][a] = c;
}
}
for (i=1;i<=n;i++) {
scanf("%d",&p[i]);
p_tot += p[i];
}
p_tot = (p_tot>>1) + 1;
dijkstra();
for (i=1;i<=n;i++) {
if (d[i]!=INF) w_tot += d[i];
}
ZeroOneDP();
ok = 0;
for (i=0;i<=w_tot;i++) {
if (dp[i]>=p_tot) {
ok = 1;
break;
}
}
if (ok) printf("%d\n",i);
else printf("impossible\n");
}
return 0;
}
void dijkstra() {
int i,j,x,y,min;
for (i=0;i<=n;i++) d[i] = (i==0)?0:INF;
for (i=0;i<=n;i++) {
min = INF;
for (j=0;j<=n;j++) {
if (!vis[j] && d[j]<min) {
min = d[j];
x = j;
}
}
if (min==INF) return;
vis[x] = 1;
for (y=0;y<=n;y++) {
d[y] = (d[y]<d[x]+w[x][y])?d[y]:d[x]+w[x][y];
}
}
}
void ZeroOneDP() {
int i,j;
for (i=1;i<=n;i++) {
if (d[i]!=INF) for (j=w_tot;j>=d[i];j--) {
dp[j] = smax(dp[j],dp[j-d[i]]+p[i]);
}
}
}