hdoj3371Connect the Cities
来源:互联网 发布:电缆报价软件 编辑:程序博客网 时间:2024/06/06 02:09
Connect the Cities
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13720 Accepted Submission(s): 3710
Problem Description
In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government wants to build some roads to connect all of these cities again, but they don’t want to take too much money.
Input
The first line contains the number of test cases.
Each test case starts with three integers: n, m and k. n (3 <= n <=500) stands for the number of survived cities, m (0 <= m <= 25000) stands for the number of roads you can choose to connect the cities and k (0 <= k <= 100) stands for the number of still connected cities.
To make it easy, the cities are signed from 1 to n.
Then follow m lines, each contains three integers p, q and c (0 <= c <= 1000), means it takes c to connect p and q.
Then follow k lines, each line starts with an integer t (2 <= t <= n) stands for the number of this connected cities. Then t integers follow stands for the id of these cities.
Each test case starts with three integers: n, m and k. n (3 <= n <=500) stands for the number of survived cities, m (0 <= m <= 25000) stands for the number of roads you can choose to connect the cities and k (0 <= k <= 100) stands for the number of still connected cities.
To make it easy, the cities are signed from 1 to n.
Then follow m lines, each contains three integers p, q and c (0 <= c <= 1000), means it takes c to connect p and q.
Then follow k lines, each line starts with an integer t (2 <= t <= n) stands for the number of this connected cities. Then t integers follow stands for the id of these cities.
Output
For each case, output the least money you need to take, if it’s impossible, just output -1.
Sample Input
16 4 31 4 22 6 12 3 53 4 332 1 22 1 33 4 5 6
Sample Output
1prim:#include<stdio.h>#include<string.h>#define INF 0x3f3f3f#define max 500+10int visit[max],map[max][max],low[max],used[max];int city,road,connect,n;void prim(){ int i,j,next; int min,mincost=0; for(i=1;i<=city;i++) { visit[i]=0; low[i]=map[1][i]; } visit[1]=1; for(i=2;i<=city;i++) { min=INF; next=1; for(j=1;j<=city;j++) //寻找距离最近的点 { if(!visit[j]&&min>low[j]) { min=low[j]; next=j; } } if(min==INF) { printf("-1\n"); return ; } visit[next]=1; mincost+=min; for(j=1;j<=city;j++)//更新路径 { if(!visit[j]&&map[next][j]<low[j]) low[j]=map[next][j]; } } printf("%d\n",mincost);}int main(){ int t,i,j,x,y,c; scanf("%d",&t); while(t--) { scanf("%d%d%d",&city,&road,&connect); for(i=1;i<=city;i++) { for(j=1;j<=city;j++) { if(i==j) map[i][j]=0; else map[i][j]=INF; } } while(road--) { scanf("%d%d%d",&x,&y,&c); if(map[x][y]>c) map[x][y]=map[y][x]=c; } while(connect--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&used[i]); for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { map[used[i]][used[j]]=map[used[j]][used[i]]=0; } } } prime(); } return 0;}
0 0
- hdoj3371Connect the Cities
- Connect the Cities
- hdu3371 Connect the Cities
- Connect the Cities
- HDU3371--Connect the Cities
- hdu_3371 Connect the Cities
- hdu3371 Connect the Cities
- J - Connect the Cities
- Connect the Cities
- hud Connect the Cities
- HDU3371 Connect the Cities
- Connect the Cities
- hdu3371: Connect the Cities
- Connect the Cities
- hdu_3371 Connect the Cities
- HDU3371--- Connect the Cities
- Connect the Cities 3371
- Connect the Cities--hdoj
- MYSQL replace
- pscp+psftp+putty的使用
- C++创建与销毁对象
- 深入理解java的finalize
- 地图,CoreLocation地理编码,反地理编码
- hdoj3371Connect the Cities
- Android开发实现连续跳转几个界面后在最后一个界面完美跳回最初的界面
- VS2005调节主界面时,界面上的控件,以及(tab control中的)子界面上的控件一起缩放
- POJ 2235 Frogger 最小生成树 Kruskal && Prim
- SOAPUI 数据源设置
- 斯坦福ML公开课笔记14——主成分分析
- stm8时钟切换
- iOS实战中的两种应用框架
- HDU_4731 Minimum palindrome(找规律)