ZOJ 2326 Tangled in Cables(最小生成树--prime)
2015-08-14 20:16
363 查看
Tangled in Cables
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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�Cz,A�CZ,0�C9} 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
ac代码:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define MAXN 1010
#define INF 0x7ffffffff
#define max(a,b) a>b?a:b
#define min(a,b) a>b?b:a
using namespace std;
char s[MAXN][30];
double pri[MAXN][MAXN];
char s1[MAXN];
int v[MAXN];
double dis[MAXN];
double mi,sum;
int n;
int check()
{
int i;
int k;
for(i=1;i<=n;i++)
{
if(strcmp(s[i],s1)==0)
{
k=i;
break;
}
}
return k;
}
void prime()
{
memset(v,0,sizeof(v));
v[1]=1;
int i,j,k;
for(i=1;i<=n;i++)
{
dis[i]=pri[1][i];
}
sum=0;
for(i=0;i<n;i++)
{
mi=INF;
for(j=1;j<=n;j++)
{
if(v[j]==0&&dis[j]<mi)
{
mi=dis[j];
k=j;
}
}
if(mi==INF)
break;
sum+=mi;
v[k]=1;
for(j=1;j<=n;j++)
{
if(v[j]==0)
dis[j]=min(dis[j],pri[k][j]);
}
}
}
int main()
{
double M,c;
int i,j,m,a,b;
char ss[MAXN];
while(scanf("%lf",&M)!=EOF)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",ss);
strcpy(s[i],ss);
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
pri[i][j]=INF;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%s",s1);
a=check();
scanf("%s",s1);
b=check();
scanf("%lf",&c);
if(pri[a][b]>c)
pri[a][b]=pri[b][a]=c;
}
prime();
if(sum>M)
printf("Not enough cable\n");
else
printf("Need %.1lf miles of cable\n",sum);
}
return 0;
}
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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�Cz,A�CZ,0�C9} 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
ac代码:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define MAXN 1010
#define INF 0x7ffffffff
#define max(a,b) a>b?a:b
#define min(a,b) a>b?b:a
using namespace std;
char s[MAXN][30];
double pri[MAXN][MAXN];
char s1[MAXN];
int v[MAXN];
double dis[MAXN];
double mi,sum;
int n;
int check()
{
int i;
int k;
for(i=1;i<=n;i++)
{
if(strcmp(s[i],s1)==0)
{
k=i;
break;
}
}
return k;
}
void prime()
{
memset(v,0,sizeof(v));
v[1]=1;
int i,j,k;
for(i=1;i<=n;i++)
{
dis[i]=pri[1][i];
}
sum=0;
for(i=0;i<n;i++)
{
mi=INF;
for(j=1;j<=n;j++)
{
if(v[j]==0&&dis[j]<mi)
{
mi=dis[j];
k=j;
}
}
if(mi==INF)
break;
sum+=mi;
v[k]=1;
for(j=1;j<=n;j++)
{
if(v[j]==0)
dis[j]=min(dis[j],pri[k][j]);
}
}
}
int main()
{
double M,c;
int i,j,m,a,b;
char ss[MAXN];
while(scanf("%lf",&M)!=EOF)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",ss);
strcpy(s[i],ss);
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
pri[i][j]=INF;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%s",s1);
a=check();
scanf("%s",s1);
b=check();
scanf("%lf",&c);
if(pri[a][b]>c)
pri[a][b]=pri[b][a]=c;
}
prime();
if(sum>M)
printf("Not enough cable\n");
else
printf("Need %.1lf miles of cable\n",sum);
}
return 0;
}
相关文章推荐
- webservice异常
- How do I detect which iOS is running on user's device programmatically?
- OC - Memory
- 杭电 1285 确定比赛名次(拓扑排序)
- 计算git树上任意两点的最近分割点。
- 初探 iOS8 中的 Size Class(转载)
- 利用工厂模式实现Dao层和Service的解耦
- 【转】Java线程面试题Top50
- HDU 2094 产生冠军
- 【Ajax技术】Ajax技术回顾与XHR对象的创建
- hdu 4586 Play the Dice(概率dp)
- UVa10596 Morning Walk
- poj 1269
- NZND壳-第三天
- ECMall /app/buyer_groupbuy.app.php SQL Injection Vul
- dotNET使用DRPC远程调用运行在Storm上的Topology
- 利用tcpdump+wireshark对android进行抓包分析
- OC - Property
- 在网站中嵌入视频教学系统
- python3之循环