HDU 3339--In Action【Floyd+01背包】
来源:互联网 发布:淘宝不匿名购买会怎样 编辑:程序博客网 时间:2024/05/20 06:24
In Action
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4358 Accepted Submission(s): 1406
Problem Description
Since 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe.
Nowadays,the crazy boy in FZU named AekdyCoin possesses some nuclear weapons and wanna destroy our world. Fortunately, our mysterious spy-net has gotten his plan. Now, we need to stop it.
But the arduous task is obviously not easy. First of all, we know that the operating system of the nuclear weapon consists of some connected electric stations, which forms a huge and complex electric network. Every electric station has its power value. To start the nuclear weapon, it must cost half of the electric network's power. So first of all, we need to make more than half of the power diasbled. Our tanks are ready for our action in the base(ID is 0), and we must drive them on the road. As for a electric station, we control them if and only if our tanks stop there. 1 unit distance costs 1 unit oil. And we have enough tanks to use.
Now our commander wants to know the minimal oil cost in this action.
Input
The first line of the input contains a single integer T, specifying the number of testcase in the file.
For each case, first line is the integer n(1<= n<= 100), m(1<= m<= 10000), specifying the number of the stations(the IDs are 1,2,3...n), and the number of the roads between the station(bi-direction).
Then m lines follow, each line is interger st(0<= st<= n), ed(0<= ed<= n), dis(0<= dis<= 100), specifying the start point, end point, and the distance between.
Then n lines follow, each line is a interger pow(1<= pow<= 100), specifying the electric station's power by ID order.
For each case, first line is the integer n(1<= n<= 100), m(1<= m<= 10000), specifying the number of the stations(the IDs are 1,2,3...n), and the number of the roads between the station(bi-direction).
Then m lines follow, each line is interger st(0<= st<= n), ed(0<= ed<= n), dis(0<= dis<= 100), specifying the start point, end point, and the distance between.
Then n lines follow, each line is a interger pow(1<= pow<= 100), specifying the electric station's power by ID order.
Output
The minimal oil cost in this action.
If not exist print "impossible"(without quotes).
If not exist print "impossible"(without quotes).
Sample Input
22 30 2 92 1 31 0 2132 12 1 313
Sample Output
5impossible
/*是多个tank从0位置出发,一个tank只能摧毁一个。*/#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define INF 0x3f3f3f3f#define maxn 1100using namespace std;int dist[maxn],power[maxn],map[maxn][maxn];int dp[1100000],n,m;void floyd(){ int i,j,k; for(k=0;k<=n;++k) for(i=0;i<=n;++i) for(j=0;j<=n;++j) map[i][j]=map[i][j]<map[i][k]+map[k][j]?map[i][j]:map[i][k]+map[k][j];}int main (){ int T,i,j; scanf("%d",&T); while(T--){ scanf("%d%d",&n,&m); for(i=0;i<=n;++i) for(j=0;j<=n;++j){ if(i==j) map[i][j]=0; else map[i][j]=map[j][i]=INF; } int x,y,d; for(i=1;i<=m;++i){ scanf("%d%d%d",&x,&y,&d); map[x][y]=map[y][x]=min(d,map[x][y]); } int sump=0,sumd=0,mark=0; for(i=1;i<=n;++i){ scanf("%d",&power[i]); sump+=power[i];//收集的能量 } floyd(); for(i=1;i<=n;++i){ dist[i]=map[0][i]; sumd+=dist[i];//耗油量 if(dist[i]==INF){ mark=1; break; } } if(mark){ printf("impossible\n"); continue; } memset(dp,0,sizeof(dp)); for(i=1;i<=n;++i){ for(j=sumd;j-dist[i]>=0;--j) dp[j]=dp[j-dist[i]]+power[i]>dp[j]?dp[j-dist[i]]+power[i]:dp[j]; } sump=sump/2+1; for(i=1;i<=sumd;++i){ if(dp[i]>=sump){ printf("%d\n",i); break; } }} return 0;}
0 0
- HDU 3339--In Action【Floyd+01背包】
- HDU-3339-In Action(Dijkstra+01背包)
- HDU 3339 In Action (最短路径+DP(01背包))
- hdu 3339 In Action spfa最短路+01背包
- 【hdu 3339】 In Action (Dijkstra+01背包)
- hdu 3339 In Action(最短路+01背包)
- HDU 3339 In Action(01背包+Dijkstra算法)
- hdu 3339 In Action dijkstra邻接矩阵+01背包
- hdu 3339 In Action(最短路径+01背包)
- HDU-3339 In Action 最短路+01背包
- hdu 3339 In Action 最短路+01背包
- Hdu 3339 In Action[最短路+01背包]
- hdu 3339 In Action(最短路+01背包)
- HDU 3339 In Action 最短路+01背包
- HDU 3339 In Action 最短路+01背包
- hdu 3339 In Action(最短路spfa+01背包)
- HDU - 3339 In Action (最短路Dijkstra+01背包)
- HDU 3339 In Action 最短路+01背包
- Session
- 多线程
- test
- 【Arduino学习笔记】ULN2003APG步进电机控制代码
- hdoj 1203 01背包变形
- HDU 3339--In Action【Floyd+01背包】
- 恢复被rm意外删除数据文件
- Tomcat中JVM内存溢出及合理配置
- 英文序數寫法與唸法 Ordinal Numbers(轉載)
- 高级的设计导航功能
- cocos2d-x的实现类
- java中的集合类
- strace工具的实现原理
- HDU 2602--Bone Collector【01背包】