ZOJ 1586 QS Network

QS Network

ZOJ problem Set-1586 QS Network Time limit: 2 Seconds Memory Limit: 65536 KB Sunny Cup 2003-preliminary Round

April 20th, 12:00-17:00

Problem E:qs Network

In the planet w-503 of Galaxy CGB, there are a kind of intelligent creature named QS. Qscommunicate with all other via networks. If the QS want to get connected, the they need to buy the network adapters (one for each QS) and a segment of the network cable. Please be advised that one NETWORK ADAPTER CAN is only used in A and 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 their message to all the QS it was connected with, the group of QS Eive the message broadcast the message to all the "Qs they connected with," the procedure repeats until all the QS ' s has a re ceived 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 have its Favorate brand's 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's 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 the data sets.

From the second line there is 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.

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 is non-negative and not more than 1000.

Output

For each data set,output, the minimum cost of 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

Minimum spanning tree template title.

1#include <iostream>2#include <string.h>3#include <stdio.h>4#include <algorithm>5 #defineINF 0x3f3f3f3f6 using namespacestd;7 Const intN =1010;8 intG[n][n], a[n], d[n], vis[n];9 intt, N;Ten intPrim () { One      for(inti =1; I <= N; i + +) { AD[i] = INF, vis[i] =0; -     } -d[1] =0; the     intres =0; -      while(true) { -         intv =-1; -          for(inti =1; I <= N; i + +) { +             if(!vis[i] && (v = =-1|| D[i] < d[v])) v =i; -         } +         if(v = =-1) Break; AVIS[V] =1; atRes + =D[v]; -          for(inti =1; I <= N; i + +) -D[i] = min (D[i], g[v][i]+a[v]+a[i]); -     } -     returnRes; - } in intMain () { -Cin>>T; to      while(t--) { +Cin>>N; -          for(inti =1; I <= N; i + +) cin>>A[i]; the          for(inti =1; I <= N; i + +) { *              for(intj =1; J <= N; J + +) cin>>G[i][j]; $         }Panax Notoginsengprintf"%d\n", Prim ()); -     } the     return 0; +}

ZOJ 1586 QS Network