zoukankan      html  css  js  c++  java
  • ZOJ-1586QS Network(prim)

    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 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<cstdio>
    #include<cstring>
    #define MAXN 1100
    using namespace std;
    int map[MAXN][MAXN];
    const int INF=999999;
    int t[MAXN];
    bool vis[MAXN];
    int main()
    {
        int te;
        while(scanf("%d",&te)!=EOF)
        {
            while(te--)
            {
                int d,n;
                int res=0;
                memset(vis,false,sizeof(vis));
                memset(map,0,sizeof(map));
                scanf("%d",&n);
                for(int i=0;i<n;i++)
                {
                    scanf("%d",&d);
                    for(int j=0;j<n;j++)
                        for(int k=0;k<n;k++)
                          if((i==k||i==j)&&(j!=k))    map[j][k]+=d;
                }
                for(int i=0;i<n;i++)
                    for(int j=0;j<n;j++)
                    {
                        scanf("%d",&d);
                        map[i][j]+=d;
                    }
                for(int i=1;i<n;i++)    t[i]=map[i][0];
                while(true)
                {
                    int k=0;
                    int min=INF;
                    vis[0]=true;
                    for(int i=0;i<n;i++)
                    {
                        if((!vis[i])&&t[i]<min){
                            k=i;
                            min=t[i];
                        }
                    }
                    if(!k)    break;
                    res+=min;
                    vis[k]=true;
                    for(int i=0;i<n;i++)
                        if((!vis[i])&&(t[i]>map[k][i]))
                            t[i]=map[k][i];
                }
                printf("%d
    ",res);
            }
        }
        return 0;
    }




  • 相关阅读:
    Java基础
    HTML笔记
    Java简介
    win8 图标 汇总 希望做Windows 8 应用的朋友用得着
    amCharts 的完整使用及破解[我弄过的]
    找了几个地方:发现关于SQL 的基本使用sql日期精确推算
    使用powerdesigner生成Pdm
    windows 8 Metro 设置选中ListViewItem 的样式
    关于DataTable与IList和List泛型集合的相互转换在网上总结
    C++ RString (原生字符串)
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770983.html
Copyright © 2011-2022 走看看