pursuit的专栏

如果一个人不愿意在平静中度过一生,就要像雄鹰一样忍住孤独,背负青天,傲然飞翔,以独特的眼力和胆略审视这个世界,用清晰而坚定的智慧眼光捕捉任何一个成功的机遇。...

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");
}


阅读更多
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭