QS Network
来源:互联网 发布:查看php fpm端口号 编辑:程序博客网 时间:2024/05/15 23:51
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.
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.
for each data set,output the minimum cost in a line. NO extra empty lines needed.
<b< dd="">
1
3
10 20 30
0 100 200
100 0 300
200 300 0
370
#include<stdio.h>#include <algorithm>using namespace std;int pre[10005];struct node{int u,v,w;}edge[500100];bool cmp(node a,node b){return a.w<b.w;}int find(int x){if(pre[x]==x)return x;else{pre[x]=find(pre[x]);return pre[x];}}bool join(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){pre[fy]=fx;return 1;}elsereturn 0;}int main(){int t,n,i,j,temp;int cnt;int count,sum;int price[1005];scanf("%d",&t); while(t--){count=0;sum=0;scanf("%d",&n);cnt=1;for(i=1;i<=n;i++)scanf("%d",&price[i]);for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&temp);if(i<j){edge[cnt].u=i;edge[cnt].v=j;edge[cnt].w=price[i]+price[j]+temp;cnt++;}}}sort(edge+1,edge+cnt,cmp);for(i=1;i<=n;i++)pre[i]=i;for(i=1;i<cnt;i++){if(join(edge[i].u,edge[i].v)){count++;sum=sum+edge[i].w;}if(count==n-1)break;}printf("%d\n",sum);}return 0;}
- QS Network
- QS Network
- QS Network
- QS Network
- QS Network
- FZU 1096 QS Network
- FOJ QS Network
- ZOJ 1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- ZOJ 1586 QS Network
- HUT G - QS Network
- G - QS Network
- ZOJ-1586-QS Network
- zoj_1586 QS Network
- ZOJ:1586 QS Network
- zoj 1586 QS Network
- ZOJ-1586 QS Network
- pyramid框架学习之(一)——搭建第一个pyramid应用
- NYOJ460 项链(环形区间DP)
- CCF CSP 201609-1 最大波动(Java-100分)
- jquery的autocompelete()自动完成事件以及后追加的页面元素无法绑定事件
- cookie保存用户浏览记录
- QS Network
- 框架学习之mybatis整合spring
- static总结
- Spring Boot之旅:Java安全框架Apache Shiro基本配置(一)
- linux笔记
- 八 iOS之 图片加水印
- S7200目录
- class.getResource("XXX").getPath()返回路径空格变成了 异常解决
- Spark1.5堆内存分配