poj 1287 Networking
2016-02-04 20:44
253 查看
Networking
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.
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.
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
Sample Output
Source
Southeastern Europe 2002
非常简单的一道最小生成树
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
int from;
int to;
int vis;
}t[11000];
bool cmp(node a,node b)
{
return a.vis<b.vis;
}
int pre[11000];
int find(int x)
{
if(x==pre[x])
return x;
return pre[x]=find(pre[x]);
}
int i,j,k,l,m,n;
int main()
{
while(~scanf("%d",&m))
{
if(m==0)
break;
scanf("%d",&n);
int sum=0;
for(i=1;i<=m;i++)
pre[i]=i;
for(i=0;i<n;i++)
scanf("%d%d%d",&t[i].from,&t[i].to,&t[i].vis);
sort(t,t+n,cmp);
for(i=0;i<n;i++)
{
int fx=find(t[i].from);
int fy=find(t[i].to);
if(fx!=fy)
{
pre[fx]=fy;
sum=sum+t[i].vis;
}
}
printf("%d\n",sum);
}
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 7818 | Accepted: 4289 |
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.
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.
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 0 2 3 1 2 37 2 1 17 1 2 68 3 7 1 2 19 2 3 11 3 1 7 1 3 5 2 3 89 3 1 91 1 2 32 5 7 1 2 5 2 3 7 2 4 8 4 5 11 3 5 10 1 5 6 4 2 12 0
Sample Output
0 17 16 26
Source
Southeastern Europe 2002
非常简单的一道最小生成树
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
int from;
int to;
int vis;
}t[11000];
bool cmp(node a,node b)
{
return a.vis<b.vis;
}
int pre[11000];
int find(int x)
{
if(x==pre[x])
return x;
return pre[x]=find(pre[x]);
}
int i,j,k,l,m,n;
int main()
{
while(~scanf("%d",&m))
{
if(m==0)
break;
scanf("%d",&n);
int sum=0;
for(i=1;i<=m;i++)
pre[i]=i;
for(i=0;i<n;i++)
scanf("%d%d%d",&t[i].from,&t[i].to,&t[i].vis);
sort(t,t+n,cmp);
for(i=0;i<n;i++)
{
int fx=find(t[i].from);
int fy=find(t[i].to);
if(fx!=fy)
{
pre[fx]=fy;
sum=sum+t[i].vis;
}
}
printf("%d\n",sum);
}
}
相关文章推荐
- python中yield语句详解——译自stack overflow
- 高精度整数 5
- Android学习路线(二十四)ActionBar Fragment运用最佳实践
- Quartz-Cron Expression 使用介绍
- MediaRecorder可以实现录音和录像
- CAS FOR WINDOW ACTIVE DIRECTORY SSO单点登录
- 数组
- ffmpeg安装
- 动态标绘演示系统1.0.1(for OpenLayers3)
- IPv4头部结构具体解释
- 【MongoDB】——可视化界面
- HDOJ 2073 无限的路
- HDOJ 2073 无限的路
- springmvc(十四)springmvc注解开发-springmvc参数绑定-数组绑定
- 单点登录系统cas资料汇总
- 解决 ORA-12514: TNS: 监听程序当前无法识别连接描述符中请求的服务
- How to configure CDB in Qt Creator(使用VC调试器)
- Java并发程序基础
- stringstream
- icon格式图标下载网站