POJ1258 Agri-Net 【最小生成树Prim】
2014-10-18 12:19
441 查看
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
#include <string.h>
#define maxn 110
#define maxm maxn * maxn
#define inf 0x3f3f3f3f
int n, id, dist[maxn];
int G[maxn][maxn];
bool vis[maxn];
void getMap() {
int u, v, k, dis, i, j; id = 0;
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
scanf("%d", &G[i][j]);
}
int getNext() {
int i, pos = -1, dis = inf;
for(i = 0; i < n; ++i)
if(!vis[i] && dist[i] < dis) {
dis = dist[i]; pos = i;
}
return pos;
}
int Prim() {
int sum = 0, i, u, v;
for(i = 0; i < n; ++i) {
vis[i] = 0; dist[i] = inf;
}
u = 0; dist[u] = 0;
while(u != -1) {
vis[u] = 1; sum += dist[u];
for(i = 0; i < n; ++i)
if(!vis[i] && dist[i] > G[u][i])
dist[i] = G[u][i];
u = getNext();
}
return sum;
}
void solve() {
printf("%d\n", Prim());
}
int main() {
// freopen("stdin.txt", "r", stdin);
while(scanf("%d", &n) == 1) {
getMap();
solve();
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 40889 | Accepted: 16677 |
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
水题
#include <stdio.h>#include <string.h>
#define maxn 110
#define maxm maxn * maxn
#define inf 0x3f3f3f3f
int n, id, dist[maxn];
int G[maxn][maxn];
bool vis[maxn];
void getMap() {
int u, v, k, dis, i, j; id = 0;
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
scanf("%d", &G[i][j]);
}
int getNext() {
int i, pos = -1, dis = inf;
for(i = 0; i < n; ++i)
if(!vis[i] && dist[i] < dis) {
dis = dist[i]; pos = i;
}
return pos;
}
int Prim() {
int sum = 0, i, u, v;
for(i = 0; i < n; ++i) {
vis[i] = 0; dist[i] = inf;
}
u = 0; dist[u] = 0;
while(u != -1) {
vis[u] = 1; sum += dist[u];
for(i = 0; i < n; ++i)
if(!vis[i] && dist[i] > G[u][i])
dist[i] = G[u][i];
u = getNext();
}
return sum;
}
void solve() {
printf("%d\n", Prim());
}
int main() {
// freopen("stdin.txt", "r", stdin);
while(scanf("%d", &n) == 1) {
getMap();
solve();
}
return 0;
}
相关文章推荐
- poj1258 Agri-Net 最小生成树 prim kruskal 模板
- 超详细最小生成树 prim 普里姆算法 poj1258 Agri-Net 最小生成树基础题 MST
- poj1258 Agri-Net最小生成树问题
- POJ1258 Agri-Net(简单的prim最小生成树)
- POJ 1258 - Agri-Net(最小生成树' Prim)
- [poj1258 Agri-Net]最小生成树
- poj1258 Agri-Net 最小生成树,kruskal算法
- POJ1258 Agri-Net(Prim求解最小生成树)
- POJ 1258 Agri-Net 最小生成树 prim && kruskal
- USACO section 3.1 Agri-Net(最小生成树,prim)
- (最小生成树-Prim)PKU-1258 Agri-Net
- POJ 1258 Agri-Net最小生成树 prim
- POJ 1258 Agri-Net 最小生成树 Prim
- poj1258 - Agri-Net (经典邻接矩阵 求最小生成树) (Prim & Kruskal)
- POJ 1258:Agri-Net Prim最小生成树模板题
- POJ 1258:Agri-Net:典型prim最小生成树(3)
- Agri-Net(最小生成树_prim||kruskral )
- poj 1258 Agri-Net (最小生成树 prim)
- poj 1258 Agri-Net(prim求最小生成树)
- POJ 1258 Agri-Net(最小生成树-Prim)