POJ2421 Constructing Roads(最小生成树,Prim)
2017-03-06 20:26
344 查看
题目:
[Submit] [Go Back] [Status]
[Discuss]
思路:
~~~~~~~~水~~~~水~~~~~水~~~~~
代码:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define N 1000+20
#define M 10000+20
#define MOD 1000000000+7
#define inf 0x3f3f3f3f
using namespace std;
int n,m;
int map
,dis
;
bool vis
;
void init()
{
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
i==j?map[i][j]=0:map[i][j]=inf;
}
void Prim()
{
int minn;
int k;
for(int i=1; i<=n; i++)
{
dis[i]=map[1][i];
vis[i]=0;
}
vis[1]=1;//从1号点开始
int sum=0;
for(int i=1; i<=n-1; i++)
{
minn=inf;
for(int j=1; j<=n; j++)
{
if(!vis[j]&&dis[j]<minn)
{
minn=dis[j];
k=j;
}
}
vis[k]=1;
sum+=dis[k];
for(int j=1; j<=n; j++)
if(!vis[j]&&map[k][j]<dis[j])
dis[j]=map[k][j];
}
printf("%d\n",sum);
}
int main()
{
while(~scanf("%d",&n))
{
int x;
init();
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
scanf("%d",&x);
map[i][j]=min(map[i][j],x);
}
}
scanf("%d",&m);
int a,b;
for(int i=1; i<=m; i++)
{
scanf("%d%d",&a,&b);
map[a][b]=map[b][a]=0;
}
Prim();
}
return 0;
}
Constructing Roads
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected. We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum. Input The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j. Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built. Output You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum. Sample Input 3 0 990 692 990 0 179 692 179 0 1 1 2 Sample Output 179 Source PKU Monthly,kicc |
[Discuss]
思路:
~~~~~~~~水~~~~水~~~~~水~~~~~
代码:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define N 1000+20
#define M 10000+20
#define MOD 1000000000+7
#define inf 0x3f3f3f3f
using namespace std;
int n,m;
int map
,dis
;
bool vis
;
void init()
{
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
i==j?map[i][j]=0:map[i][j]=inf;
}
void Prim()
{
int minn;
int k;
for(int i=1; i<=n; i++)
{
dis[i]=map[1][i];
vis[i]=0;
}
vis[1]=1;//从1号点开始
int sum=0;
for(int i=1; i<=n-1; i++)
{
minn=inf;
for(int j=1; j<=n; j++)
{
if(!vis[j]&&dis[j]<minn)
{
minn=dis[j];
k=j;
}
}
vis[k]=1;
sum+=dis[k];
for(int j=1; j<=n; j++)
if(!vis[j]&&map[k][j]<dis[j])
dis[j]=map[k][j];
}
printf("%d\n",sum);
}
int main()
{
while(~scanf("%d",&n))
{
int x;
init();
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
scanf("%d",&x);
map[i][j]=min(map[i][j],x);
}
}
scanf("%d",&m);
int a,b;
for(int i=1; i<=m; i++)
{
scanf("%d%d",&a,&b);
map[a][b]=map[b][a]=0;
}
Prim();
}
return 0;
}
相关文章推荐
- poj 2421 Constructing Roads prim最小生成树 基础!!!
- Poj 2421 Constructing Roads(Prim 最小生成树)
- Poj 2421 Constructing Roads(Prim 最小生成树)
- Poj(2421),Prim最小生成树
- poj 2421 Constructing Roads(最小生成树prim)
- poj 1258 最小生成树 prim+优先队列
- poj 2421 Constructing Roads 最小生成树
- poj 1251 1258 2421 2485(最小生成树prime)
- poj 2485 Highways prim最小生成树 基础 球最小生成树中得最大边
- poj 1789 Truck History(最小生成树 prim)
- POJ 2421 Constructing Roads(最小生成树)
- POJ2485 prim 最小生成树
- poj 1789 Prim最小生成树
- poj 1251 Jungle Roads prim最小生成树基础
- poj 2349 (最小生成树 Prim)
- poj 2560最小生成树 prim
- POJ 2253 Frogger (最小生成树.Prim)
- POJ 2421 图的最小生成树 prim算法 模板代码的利用
- POJ1258 Agri-Net(简单的prim最小生成树)
- poj 2421(最小生成树)