# http://poj.org/problem?id=2075

Description

You are the owner of SmallCableCo and have purchased the franchise rights for a small town. Unfortunately, you lack enough funds to start your business properly and are relying on parts you have found in an old warehouse you bought. Among your finds is a single spool of cable and a lot of connectors. You want to figure out whether you have enough cable to connect every house in town. You have a map of town with the distances for all the paths you may use to run your cable between the houses. You want to calculate the shortest length of cable you must have to connect all of the houses together.
Input

Only one town will be given in an input.

The first line gives the length of cable on the spool as a real number.

The second line contains the number of houses, N

The next N lines give the name of each house's owner. Each name consists of up to 20 characters {a–z,A–Z,0–9} and contains no whitespace or punctuation.

Next line: M, number of paths between houses

next M lines in the form

< house name A > < house name B > < distance >
Where the two house names match two different names in the list above and the distance is a positive real number. There will not be two paths between the same pair of houses.
Output

The output will consist of a single line. If there is not enough cable to connect all of the houses in the town, output
Not enough cable
If there is enough cable, then output
Need < X > miles of cable
Print X to the nearest tenth of a mile (0.1).
Sample Input

100.0
4
Jones
Smiths
Howards
Wangs
5
Jones Smiths 2.0
Jones Howards 4.2
Jones Wangs 6.7
Howards Wangs 4.0
Smiths Wangs 10.0
Sample Output

Need 10.2 miles of cable

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string.h>
#define INF 9999999.0
#define MAX 310
#define FOR(i,s,t) for(int i=(s);i<=t;++i)
#define CRL(array,val) memset(array,val,sizeof(array))
using namespace std;
char town[MAX][25];
double map[MAX][MAX];
double dis[MAX];
bool used[MAX];
int n;
double Prim()
{     FOR(i,1,n)
{  dis[i]=INF;
used[i]=false;
}
int now = 1;
used[now] = true;
dis[now] = 0;
FOR(i,1,n)
{    FOR(k,1,n)
if( !used[k] && dis[k] > map[now][k] )
dis[k] = map[now][k];
double minx = INF;
FOR(k,1,n)
if( dis[k] < minx && !used[k] )
minx = dis[now = k];
used[now] = true;
}
double ans = 0.0;
FOR(i,1,n)
if( dis[i] != INF )
ans += dis[i];
else
return -1;
return ans;
}
int main()
{double cabs;
scanf("%lf%d",&cabs,&n);
FOR(i,1,n)
FOR(j,1,n)
map[i][j]=INF;
FOR(i,1,n)
scanf("%s",town[i]);
int m;
scanf("%d",&m);
while( m-- )
{        char a[25],b[25];
double  len;
scanf("%s%s%lf",a,b,&len);
int aa =0,bb = 0;
FOR(i,1,n)
{if( aa && bb ) break;
if( strcmp(a,town[i]) == 0 )
aa = i;
if( strcmp(b,town[i]) == 0 )
bb = i;
}
map[aa][bb] = map[bb][aa] = len;
}
double ans = Prim();
if( ans == -1 || ans > cabs )
printf("Not enough cable\n");
else
printf("Need %.1lf miles of cable\n",ans);
return 0;
//system("pause");
}


#### http://poj.org/problem?id=1384

2013-04-04 10:45:37

#### POJ 1651 —— Multiplication Puzzle

2016-05-18 21:36:12

#### POJ 1061 青蛙的约会 扩展欧几里得http://poj.org/problem?id=1061

2012-07-28 09:21:46

#### poj1458 - Common Subsequence

2012-06-01 12:47:24

#### POJ1830 开关问题

2016-08-26 15:17:29

#### POJ1651

2012-08-10 17:00:48

#### poj1458 最长公共子序列

2017-03-27 19:34:55

#### POJ 1466 Girls and Boys(二分图最大独立集)

2014-08-17 12:57:32

#### 深搜 poj1011

2013-01-21 08:38:38

#### POJ 2046 Gap 笔记

2016-12-25 19:17:19