admin管理员组文章数量:1558087
Networking
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 12530 Accepted: 6732
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
1 0
2 3
1 2 37
2 1 17
1 2 683 7
1 2 19
2 3 11
3 1 7
1 3 5
2 3 89
3 1 91
1 2 325 7
1 2 5
2 3 7
2 4 8
4 5 11
3 5 10
1 5 6
4 2 120
Sample Output
0
17
16
26
Source
Southeastern Europe 2002
最小生成树,prim算法
代码:
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX = 55;
const int INF = 987654321;
int Map[MAX][MAX];
int dist[MAX];
bool book[MAX];
int prim(const int n)
{
int alldist = 0;
fill_n(book, n + 1, false);
book[1] = true;
for (int i = 1; i <= n; i++) dist[i] = Map[1][i];
for (int i = 1; i < n; i++) {
int Min = INF, pos = 0;
for (int j = 1; j <= n; j++) {
if (!book[j] && dist[j] < Min) {
pos = j;
Min = dist[j];
}
}
book[pos] = true;
alldist += Min;
for (int j = 1; j <= n; j++) if (!book[j]) dist[j] = min(Map[pos][j], dist[j]);
}
return alldist;
}
int main()
{
int n = 0, m = 0;
while (cin >> n && n) {
cin >> m;
if (m == 0) {
cout << 0 << endl;
continue;
}
for (int i = 1; i <= n; i++) {//n别搞错了
for (int j = 1; j <= n; j++)
Map[i][j] = Map[j][i] = INF;
Map[i][i] = 0;
}
int u = 0, v = 0, w = 0;
for (int i = 0; i < m; i++) {//这里是m
cin >> u >> v >> w;
Map[u][v] = Map[v][u] = min(Map[u][v], w);
}
cout << prim(n) << endl;
}
return 0;
}
//
本文标签: POJNetworking
版权声明:本文标题:POJ 1287Networking 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://m.elefans.com/dianzi/1727341787a1109504.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论