POJ 1287Networking【prim】
来源:互联网 发布:淘宝店铺运营方案 编辑:程序博客网 时间:2024/04/28 14:57
Networking
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8605 Accepted: 4769
Description
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the area.
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.
Input
The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points. The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only one number P=0 denotes the end of the input. The data sets are separated with an empty line.
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.
Output
For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.
Sample Input
1 02 31 2 372 1 171 2 683 71 2 192 3 113 1 71 3 52 3 893 1 911 2 325 71 2 52 3 72 4 84 5 113 5 101 5 64 2 120
Sample Output
0171626
Source
Southeastern Europe 2002
感觉今天没写什么题。被拉出去吊打一下午。
平时不做难题,不动脑。真正需要动脑的时候脑子根本动不起来。以后做题要多思考思考再去查题解。
很裸的最小生成树,主要是把prim算法的模板贴一下,以便以后查。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define INF 0x3f3f3f3fint map[111][111],dis[111],vis[111];int n,m,ans;int Prim(){int i,j,u;ans=0;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++)dis[i]=map[1][i];vis[1]=1;for(i=1;i<n;i++){int min=INF;for(j=1;j<=n;j++){if(!vis[j]&&dis[j]<min){min=dis[j];u=j;}}vis[u]=1;ans+=dis[u];for(j=1;j<=n;j++){if(!vis[j]&&map[u][j]<dis[j])dis[j]=map[u][j];}}return ans;}int main(){int i,j;int s,e,w;while(scanf("%d",&n),n){memset(map,INF,sizeof(map));scanf("%d",&m);for(i=0;i<m;i++){scanf("%d%d%d",&s,&e,&w);map[s][e]=map[e][s]=min(map[s][e],w);}printf("%d\n",Prim());}return 0;}
0 0
- POJ 1287Networking【prim】
- POJ.1287 Networking (Prim)
- POJ 1287Networking Prim模型
- POJ - 1287----Networking(prim)
- ZOJ 1372 / POJ 1287 Networking ( kruskal+prim )
- zoj 1372 || poj 1287 Networking ( prim || kruskal ~)
- poj 1287 Networking(kruskal || prim)
- poj 1287 Networking prim最小生成树 基础!!!
- poj 1287 Networking(prim or kruscal最小生成树)
- POJ 1287 Networking [prim求解最小生成树]
- poj 1287 Networking ( 最小生成树--prim算法)
- 图论 生成树 POJ 1287 Networking(prim)( Kruskal)
- Prim最小生成树【poj 2349 Arctic Network;poj 1287 NetWorking】
- poj 1287 Networking
- POJ-1287-Networking
- poj 1287 networking
- POJ 1287 Networking
- POJ:1287 Networking
- JavaScript 学习(二)之基本用法
- 夜神模拟器SD卡文件存储位置
- Ticket管理工具:Redmine
- Code Review 总结一
- JQuery特效多张图片上传
- POJ 1287Networking【prim】
- 关于ARGB_8888、ALPHA_8、ARGB_4444、RGB_565的理解
- POJ 3041 Asteroids
- 进程
- OpenMP中的critical指令
- poj 2318 TOYS 二分+叉积
- 码一波题单+HDOJ题目分类
- Eclipse中集成Tomcat
- 【JVM调优(一)】----JAVA内存模型抽象结构