POJ 1258 Agri-Net 最小生成树
2014-08-01 20:27
357 查看
Agri-Net
Description
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Input
The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the
distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself
is not interesting for this problem.
Output
For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.
Sample Input
Sample Output
Source
USACO 102
最小生成树,克鲁斯卡尔算法模板AC
#include <stdio.h>
#include <algorithm>
using namespace std;
struct node
{
int u;
int v;
int w;
}ls[20000];
int n,m,num;
int s[110];
void creat(int x,int y,int z)
{
ls[num].u=x;
ls[num].v=y;
ls[num].w=z;
num++;
}
int cmp(struct node a,struct node b)
{
return a.w<b.w;
}
int nfind(int x)
{
int r=x,q;
while(x!=s[x])
{
x=s[x];
}
while(s[r]!=x)
{
q=s[r];
s[r]=x;
r=q;
}
return x;
}
int cz(int x,int y)
{
int fx=nfind(x);
int fy=nfind(y);
if(fx!=fy)
{
s[fx]=fy;
return 0;
}
return 1;
}
void klske()
{
int i,sum=0;
for(i=0;i<num;i++)
{
if(!cz(ls[i].u,ls[i].v))
{
sum+=ls[i].w;
}
}
printf("%d\n",sum);
}
int main()
{
int i,j,x;
while(~scanf("%d",&n))
{
num=0;
for(i=1;i<=n;i++)
{
s[i]=i;
}
m=n;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
scanf("%d",&x);
if(j>i)
creat(i,j,x);
}
}
sort(ls,ls+num,cmp);
klske();
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 39748 | Accepted: 16155 |
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Input
The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the
distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself
is not interesting for this problem.
Output
For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.
Sample Input
4 0 4 9 21 4 0 8 17 9 8 0 16 21 17 16 0
Sample Output
28
Source
USACO 102
最小生成树,克鲁斯卡尔算法模板AC
#include <stdio.h>
#include <algorithm>
using namespace std;
struct node
{
int u;
int v;
int w;
}ls[20000];
int n,m,num;
int s[110];
void creat(int x,int y,int z)
{
ls[num].u=x;
ls[num].v=y;
ls[num].w=z;
num++;
}
int cmp(struct node a,struct node b)
{
return a.w<b.w;
}
int nfind(int x)
{
int r=x,q;
while(x!=s[x])
{
x=s[x];
}
while(s[r]!=x)
{
q=s[r];
s[r]=x;
r=q;
}
return x;
}
int cz(int x,int y)
{
int fx=nfind(x);
int fy=nfind(y);
if(fx!=fy)
{
s[fx]=fy;
return 0;
}
return 1;
}
void klske()
{
int i,sum=0;
for(i=0;i<num;i++)
{
if(!cz(ls[i].u,ls[i].v))
{
sum+=ls[i].w;
}
}
printf("%d\n",sum);
}
int main()
{
int i,j,x;
while(~scanf("%d",&n))
{
num=0;
for(i=1;i<=n;i++)
{
s[i]=i;
}
m=n;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
scanf("%d",&x);
if(j>i)
creat(i,j,x);
}
}
sort(ls,ls+num,cmp);
klske();
}
return 0;
}
相关文章推荐
- poj1258 Agri-Net (最小生成树prime)
- POJ 1258 Agri-Net(最小生成树 Prim 模版题)
- POJ 1258 Agri-Net 【最小生成树】
- POJ 1258 Agri-Net(最小生成树,基础)
- POJ 1258 Agri-Net 图论 prim算法 最小生成树
- Poj 1258 Agri-Net[MST最小生成树]
- Poj1258_Agri-Net(最小生成树)
- poj 1258 Agri-Net 最小生成树 kruskal
- poj 1258 Agri-Net 最小生成树 kruskal
- Poj1258_Agri-Net(最小生成树)
- POJ1258 Agri-Net(简单的prim最小生成树)
- POJ 1258 Agri-Net(最小生成树)
- 初级->图算法->最小生成树 poj 1258 Agri-Net
- poj 1258 Agri-Net(简单最小生成树)
- poj 1258 Agri-Net 最小生成树
- POJ 1258 Agri-Net (最小生成树入门题目)
- POJ1258 Agri-Net 最小生成树 C语言
- POJ 1258 Agri-Net 最小生成树(Kruskal算法入门)
- poj 1258 Agri-Net(最小生成树模板代码)
- POJ 1258 Agri-Net(最小生成树,模板题)