E - QS Network (Prim)

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

题意：在某个外星球有些叫QS的外星人。他们之间要相互联系。但是要买网络适配器，当然不同的QS喜欢不同价格的适配器。而且还需要买网络电缆，而且都需要费用。让你求用最小的花费去建立他们之间的联系。求最小生成树，不同的是，顶点上面也有值。可以把点的值转移到边值上，每一条边加上两连接顶点的值，这样每条边的权值都改变（除了本身顶点外）。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define INF 0x3f3f3f3f
using namespace std;
int n;
int ma[1212][1212];
int dist[1211];
int val[1212];
bool v[1211];
void Prim()
{
    memset(v, false, sizeof(v));
    v[1] = true;
    for(int i=1;i<=n;i++)
        dist[i] = ma[1][i];
    int sum = 0, Min, point;
    for(int i=1;i<=n;i++)
    {
        point = i;
        Min = INF;
        for(int j=1;j<=n;j++)
        {
            if(dist[j]<Min&&v[j]==false)
            {
                point = j;
                Min = dist[j];
            }
        }
        v[point] = true;
        if(Min==INF)//如果没有更新，跳出
        {
            cout<<sum<<endl;
            return ;
        }
        sum += Min;
        for(int j=1;j<=n;j++)
        {
            if(v[j]==false&&ma[point][j]<dist[j])
                dist[j] = ma[point][j];
        }
    }
    cout<<sum<<endl;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(int i=1;i<=n;i++)
            cin>>val[i];
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                cin>>ma[i][j];
                if(i!=j)
                ma[i][j] += val[i] + val[j];//加上定点的价值
            }
        }
        Prim();
    }
    return 0;
}