zoj 1586 QS Network
来源:互联网 发布:java手机编译器 编辑:程序博客网 时间:2024/05/22 05:31
Sunny Cup 2003 - Preliminary Round
April 20th, 12:00 - 17:00
Problem E: QS Network
In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other via networks. If two QS want to get connected, they need to buy two network adapters (one for each QS) and a segment 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
与以往不同的是不仅要算两点之间的费用,还要算两点的费用,第一次数组开小了
#include<stdio.h>#include<string.h>#include<algorithm># define N 1001# define INf (N*N-N)/2+1using namespace std;struct node{int from;int to;int price;}t[INf];//数组要开大点 bool cmp(node a,node b){return a.price<b.price;}int pre[N];int find(int x){if(x==pre[x])return x;return pre[x]=find(pre[x]);}int merge(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){pre[fx]=fy;return 1;}return 0;}int main(){int p,i,j,k,l,m,n,a[N];scanf("%d",&p);while(p--){scanf("%d",&m);for(i=1;i<=m;i++){pre[i]=i;scanf("%d",&a[i]);}k=0;for(i=1;i<=m;i++)for(j=1;j<=m;j++){scanf("%d",&n);if(i==j)continue;else{t[k].from=i; t[k].to=j; t[k].price=n+a[i]+a[j];//关键点 k++;} } sort(t,t+k,cmp); int sum=0;for(i=0;i<k;i++){if(merge(t[i].from,t[i].to))sum=sum+t[i].price;}printf("%d\n",sum);}return 0;}
- ZOJ 1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- ZOJ 1586 QS Network
- ZOJ-1586-QS Network
- ZOJ:1586 QS Network
- zoj 1586 QS Network
- ZOJ-1586 QS Network
- zoj -1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- zoj 1586 QS Network
- zoj 1586 QS Network
- ZOJ 1586 QS Network
- ZOJ--1586--QS Network
- zoj 1586 QS Network
- java序列化,反序列化及反序列如何判断是否已读到文件末尾
- Html+CSS text-indent 意义 负值用法与注意事项
- 一种抢红包实现方式
- Searching within TV Apps
- SQL基本语句
- zoj 1586 QS Network
- 分布式内存文件系统:Tachyon
- 如何减小软件包的大小
- C语言int的取值范围
- 身份证验证合法性
- 为apk签名
- UIControl头文件学习
- android studio app有错误解决方法
- git忽略本地修改更新远程仓库内容到本地