UVA 216 - Getting in Line
来源:互联网 发布:人工智能专业 教材选择 编辑:程序博客网 时间:2024/05/21 10:25
Getting in Line
Computer networking requires that the computers in the network be linked.
This problem considers a ``linear" network in which the computers are chained together so that each is connected to exactly two others except for the two computers on the ends of the chain which are connected to only one other computer. A picture is shown below. Here the computers are the black dots and their locations in the network are identified by planar coordinates (relative to a coordinate system not shown in the picture).
Distances between linked computers in the network are shown in feet.
For various reasons it is desirable to minimize the length of cable used.
Your problem is to determine how the computers should be connected into such a chain to minimize the total amount of cable needed. In the installation being constructed, the cabling will run beneath the floor, so the amount of cable used to join 2 adjacent computers on the network will be equal to the distance between the computers plus 16 additional feet of cable to connect from the floor to the computers and provide some slack for ease of installation.
The picture below shows the optimal way of connecting the computers shown above, and the total length of cable required for this configuration is (4+16)+ (5+16) + (5.83+16) + (11.18+16) = 90.01 feet.
Input
The input file will consist of a series of data sets. Each data set will begin with a line consisting of a single number indicating the number of computers in a network. Each network has at least 2 and at most 8 computers. A value of 0 for the number of computers indicates the end of input.
After the initial line in a data set specifying the number of computers in a network, each additional line in the data set will give the coordinates of a computer in the network. These coordinates will be integers in the range 0 to 150. No two computers are at identical locations and each computer will be listed once.
Output
The output for each network should include a line which tells the number of the network (as determined by its position in the input data), and one line for each length of cable to be cut to connect each adjacent pair of computers in the network. The final line should be a sentence indicating the total amount of cable used.
In listing the lengths of cable to be cut, traverse the network from one end to the other. (It makes no difference at which end you start.) Use a format similar to the one shown in the sample output, with a line of asterisks separating output for different networks and with distances in feet printed to 2 decimal places.
Sample Input
65 1955 2838 10128 62111 8443 116511 2784 99142 8188 3095 383132 7349 8672 1110
Sample Output
**********************************************************Network #1Cable requirement to connect (5,19) to (55,28) is 66.80 feet.Cable requirement to connect (55,28) to (28,62) is 59.42 feet.Cable requirement to connect (28,62) to (38,101) is 56.26 feet.Cable requirement to connect (38,101) to (43,116) is 31.81 feet.Cable requirement to connect (43,116) to (111,84) is 91.15 feet.Number of feet of cable required is 305.45.**********************************************************Network #2Cable requirement to connect (11,27) to (88,30) is 93.06 feet.Cable requirement to connect (88,30) to (95,38) is 26.63 feet.Cable requirement to connect (95,38) to (84,99) is 77.98 feet.Cable requirement to connect (84,99) to (142,81) is 76.73 feet.Number of feet of cable required is 274.40.**********************************************************Network #3Cable requirement to connect (132,73) to (72,111) is 87.02 feet.Cable requirement to connect (72,111) to (49,86) is 49.97 feet.Number of feet of cable required is 136.99.
===================================
利用next_permutation()枚举所有排列方式,分别计算距离,找到最小的,标记,输出
#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;double dis[11][11];struct point{ int x; int y; double dis;}s[11],a[11];int main(){ int t=0,n,num[11]; double sum,min; while(~scanf("%d",&n)) { if(n==0) break; min=1e9; printf("**********************************************************\n"); printf("Network #%d\n",++t); for(int i=0;i<n;i++) { scanf("%d%d",&s[i].x,&s[i].y); num[i]=i; } do { sum=0; for(int i=1;i<n;i++) { sum+=sqrt( (s[num[i]].x-s[num[i-1]].x) * (s[num[i]].x-s[num[i-1]].x)*1.0 + (s[num[i]].y-s[num[i-1]].y) * (s[num[i]].y-s[num[i-1]].y)*1.0 )+16; } if(sum<min) { for(int i=0;i<n;i++) { a[i]=s[num[i]]; } min=sum; } }while(next_permutation(num,num+n)); for(int i=1;i<n;i++) { printf("Cable requirement to connect (%d,%d) to (%d,%d) is %.2lf feet.\n",a[i-1].x,a[i-1].y,a[i].x,a[i].y, sqrt( (a[num[i]].x-a[num[i-1]].x) * (a[num[i]].x-a[num[i-1]].x)*1.0 + (a[num[i]].y-a[num[i-1]].y) * (a[num[i]].y-a[num[i-1]].y)*1.0 )+16); } printf("Number of feet of cable required is %.2lf.\n",min); } return 0;}
- UVa 216 Getting in Line
- Uva 216 Getting in Line
- uva 216 - Getting in Line
- uva 216 - Getting in Line
- UVa 216 - Getting in Line
- uva-216 - Getting in Line
- Uva 216 - Getting in Line
- uva 216 - Getting in Line
- UVa 216 - Getting in Line
- uva 216 Getting in Line
- UVA 216 - Getting in Line
- UVA 216 Getting in Line
- UVA 216 Getting in Line
- UVa 216 Getting in Line
- UVA 216 - Getting in Line
- uva 216 Getting in Line
- uva - 216 - Getting in Line
- uva 216 - Getting in Line
- AIX 磁盘、文件系统管理命令
- 标准C++中Const的详细用法总结
- JQUERY获取当前页面的URL信息
- mysql创建定时器(event),查看定时器,打开定时器,设置定时器时间
- 相同代码不同属性导致的问题
- UVA 216 - Getting in Line
- 求助.ejs文件中怎么实现类似document.getElementById()的功能?
- 关于svn提交失败的一个可能问题
- Android Smart Image View
- 背包之01背包、完全背包、多重背包详解
- 信息化管理系统在企业的应用
- android开发-WIFI网络基本操作
- Android中各种onTouch事件
- 【rmzt】云&&海边xp主题