8.3 D - 这是水题4
2017-08-03 09:19
162 查看
of network cable. Please be advised that ONE NETWORK ADAPTER CAN ONLY BE USED IN A SINGLE CONNECTION.(ie. if a QS want to setup four connections, it needs to buy four adapters). In the procedure of communication, a QS broadcasts its message to all the QS it
is connected with, the group of QS who receive the message broadcast the message to all the QS they connected with, the procedure repeats until all the QS's have received the message.
A sample is shown below:
A sample QS network, and QS A want to send a message.
Step 1. QS A sends message to QS B and QS C;
Step 2. QS B sends message to QS A ; QS C sends message to QS A and QS D;
Step 3. the procedure terminates because all the QS received the message.
Each QS has its favorate brand of network adapters and always buys the brand in all of its connections. Also the distance between QS vary. Given the price of each QS's favorate brand of network adapters and the price of cable
between each pair of QS, your task is to write a program to determine the minimum cost to setup a QS network.
Input
The 1st line of the input contains an integer t which indicates the number of data sets.
From the second line there are t data sets.
In a single data set,the 1st line contains an interger n which indicates the number of QS.
The 2nd line contains n integers, indicating the price of each QS's favorate network adapter.
In the 3rd line to the n+2th line contain a matrix indicating the price of cable between ecah pair of QS.
Constrains:
all the integers in the input are non-negative and not more than 1000.
Output
for each data set,output the minimum cost in a line. NO extra empty lines needed.
Sample Input
1
3
10 20 30
0 100 200
100 0 300
200 300 0
Sample Output
370
题意:有n个外星人想相互联系,并且每个外星人都有自己喜欢用的联系工具,每两个相互联系的外星人还需要一根有价格的网线,求出所有外星人直接或者间接能够联系所购买的联系工具和网线的最少价格。注意:比如说1号外星人和3号外星人和4号外星人能够联系,需要买2个1号外星人喜欢的联系工具.1个3号外星人喜欢的联系工具和1个4号外星人的联系工具。
先输入一个数字T,表示T组数据,然后输入数字n,接下来n个数据表示每个外星人所喜欢的联系工具的价格,
接下来一个n*n大小的矩阵,表示每两个外星人之间网线的价格。
#include<stdio.h> #include<string.h> int a[2000][2000],book[2000],d[2000],s[2000]; int main() { int i,j,k,m,n,c,t; int max=1e9,min; int t1,sum; while(scanf("%d",&t)!=EOF) { while(t--) { scanf("%d",&n); memset(a,0,sizeof(a)); memset(d,0,sizeof(d)); memset(s,0,sizeof(s)); memset(book,0,sizeof(book)); m=0; for(i=0;i<=n;i++) { for(j=0;j<=n;j++) { if(i==j) { a[i][j]=0; } else { a[i][j]=max; } } }//初始化数据 for(i=1;i<=n;i++) { scanf("%d",&s[i]);//存储每个外星人喜欢的联系工具的价格 } for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { scanf("%d",&a[i][j]); if(i!=j) { a[i][j]+=s[i]+s[ 9b70 j];//存储网线价格时同时将联系工具价格一起存入 } } } for(i=1;i<=n;i++) { d[i]=a[1][i]; } c=0; book[1]=1; c++; sum=0; while(c<n)//Prim算法计算 { min=max; for(i=1;i<=n;i++) { if(book[i]==0&&d[i]<min) { min=d[i]; j=i; } } c++; sum+=d[j]; book[j]=1; for(i=1;i<=n;i++) { if(book[i]==0&&a[j][i]<d[i]) { d[i]=a[j][i]; } } } printf("%d\n",sum); } } return 0; }
相关文章推荐
- 8.3 B - 这是水题2
- 8.3 C - 这是水题3
- 8.3 E - 这是水题5
- 8.3 F - 这是水题6
- 8.3 G - 这是水题7
- 8.3 H - 这是水题8
- 湖南科技大学 问题 B: 并查集_无线网络 水题
- hihocoder-1284 机会渺茫(水题)
- poj 1207 水题
- CodeForces 635A Orchestra(水题)
- HDU 4287 Intelligent IME 第37届ACM/ICPC天津赛区网络赛1010题 (水题)
- Codeforces 659A Round House【水题,细节】
- HDU1009 贪心水题
- ACM-水题 Higher Math
- POJ 2823 Sliding Window 线段树水题
- Codeforces Beta Round #6 (Div. 2 Only) C. Alice, Bob and Chocolate 水题
- UVA Live 5029 Encoded Barcodes 字典树-水题
- Restore 数学题,水题(转)
- YouTube Music Downloader v3.8.3-LAXiTY
- CF 628B New Skateboard --- 水题