zoj 1586 QS Network 最小生成树

最新推荐文章于 2020-02-09 11:24:31 发布

joafelnglfds

最新推荐文章于 2020-02-09 11:24:31 发布

阅读量596

点赞数

分类专栏：图论文章标签： prim

本文链接：https://blog.csdn.net/is_cp/article/details/38369063

版权

图论专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Description

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

题意及分析：

对数据进行简单的的处理，这个题就可以做出来了。还是基本的最小生成树问题。

有n个QS，为了传递信息，在他们之间建立网络。每个QS对于每一条线路使用不同的adapter（种类相同）。而且，每个QS用的牌子固定。给出任意两者之间的距离和adapter的价格。这里所做的处理就是，建立一条网络的时候，本来的费用还得加上双方的adapter的价格。这样就满足要求了。

AC代码：

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
        #include 
        
          #include 
         
           #include 
          
            #define INF 0x3f3f3f3f using namespace std; int dis[1200],edge[1200][1200],price[1200],vis[1200]; int n; int prim() { int i,j,now; memset(dis,0x3f,sizeof(dis)); memset(vis,0,sizeof(vis)); dis[1]=0; for(i=1;i<=n;i++) { int mi=INF; for(j=1;j<=n;j++) if(!vis[j]&&dis[j] 
           
             edge[now][j]) dis[j]=edge[now][j]; } int sum=0; for(i=1;i<=n;i++) sum+=dis[i]; return sum; } int main() { int i,j,t; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&price[i]); for(i=1;i<=n;i++) for(j=1;j<=n;j++) { int k; scanf("%d",&k); edge[i][j]=k+price[i]+price[j]; //每条边的费用加上adapter的价格 } printf("%d\n",prim()); } return 0; }