HDOJ 3371 Connect the Cities 【Prime】
2015-11-05 21:58
363 查看
Connect the Cities
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14510 Accepted Submission(s): 3877
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each case, output the least money you need to take, if it’s impossible, just output -1.
[align=left]Sample Input[/align]
1 6 4 3 1 4 2 2 6 1 2 3 5 3 4 33 2 1 2 2 1 3 3 4 5 6
[align=left]Sample Output[/align]
1
题目链接:HDOJ 3371 Connect the Cities 【Prime】
最小生成树 Prime 模板 Kruskal 超时
已AC代码:(Prime)
#include<cstdio> #include<cstring> #define INF 0x3f3f3f #define M 510 int map[M][M],vis[M],cost[M]; int n,m,k; void prime() { int i,j,min,sum=0,pos; for(i=1;i<=n;++i) { vis[i]=0; cost[i]=map[1][i]; } vis[1]=1;pos=1; for(i=1;i<n;++i) { min=INF; for(j=1;j<=n;++j) { if(vis[j]==0 && min>cost[j]) { min=cost[j]; pos=j; } } if(min>=INF) { printf("-1\n"); return ; } vis[pos]=1; sum+=min; for(j=1;j<=n;++j) if(vis[j]==0 && cost[j]>map[pos][j]) cost[j]=map[pos][j]; } printf("%d\n",sum); return ; } int main() { int T,i,j,a,b,c; scanf("%d",&T); while(T--) { scanf("%d%d%d",&n,&m,&k); memset(map,INF,sizeof(map)); while(m--) { scanf("%d%d%d",&a,&b,&c); if(map[a][b]>c) map[a][b]=map[b][a]=c; } int g[M]; while(k--) { scanf("%d",&a); for(i=0;i<a;++i) scanf("%d",&g[i]); for(i=0;i<a;++i) for(j=i+1;j<a;++j) map[g[i]][g[j]]=map[g[j]][g[i]]=0; } prime(); } return 0; }
相关文章推荐
- 如何设置修改WPS批注上的用户信息名称
- 检测文件(夹)大小
- [转]浅谈dijkstra堆优化
- UIView总结
- Ceph集群中如何摘除一个包含mon、osd和mds的节点
- 【Android开发—智能家居系列】(三):手机连接WIFI模块
- Android IOS WebRTC 音视频开发总结(五十)-- 技术服务如何定价?
- UIScrollView
- 【Xcode】【iOS-pod】The sandbox is not sync with the Podfile.lock
- JCenter下载太慢?教你修改Maven仓库地址为国内镜像
- 查找算法——找到序列中第二大的数(修正版)
- mac virtualBox 解决鼠标无法切换问题
- Android 布局样式和主题
- java中的时间判断
- “互联网+”创新创业计划书(二)
- Mybatis 源码分析--Configuration.xml配置文件加载到内存
- cJSON 库的使用和优化
- NSFileHandle&&NSFileManage
- 51nod 1435 位数阶乘 找规律
- [leetcode 111]Minimum Depth of Binary Tree