ZOJ1586——QS Network(最小生成树)

QS Network

Description
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是一种外星人(雾?),他们之间需要网线和路由器来联系(大雾?)。他们每个人都有自己喜欢的路由器,并且路由器上只能接一条网线(一个路由器只能与一个人联系)。

    输入T代表几组数据。每组数据的第一行为N,表示有多少个QS人,第二行为这N个人喜欢的路由器的价格。

    后面的N行为一个N*N的矩阵,表示他们之间各自的要想联系需要的网线的价格(距离)。

    输出:保证所有人相连的最小花销。

结题思路:

    最小生成树。需要注意的是 每条边的权值不单单是网线的价格还要包括两个顶点的路由器价格。

Code:

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<string>
 5 #define MAXN 1010*1010/2
 6 using namespace std;
 7 struct edge
 8 {
 9     int begin;
10     int end;
11     int dis;
12 } T[MAXN+10];
13 int father[MAXN+10],a[MAXN+10];
14 void init()
15 {
16     for (int i=1;i<=MAXN;i++)
17         father[i]=i;
18 }
19 int find(int x)
20 {
21     if (father[x]!=x)
22         father[x]=find(father[x]);
23     return father[x];
24 }
25 void join(int x,int y)
26 {
27     int fx=find(x),fy=find(y);
28     if (fx!=fy)
29         father[fx]=fy;
30 }
31 bool cmp(struct edge a,struct edge b)
32 {
33     return a.dis<b.dis;
34 }
35 int main()
36 {
37     int C;
38     cin>>C;
39     while (C--)
40     {
41         init();
42         int k=1;
43         int N;
44         cin>>N;
45         int cnt=0;
46         for (int i=1; i<=N; i++)
47             cin>>a[i];
48         for (int i=1; i<=N; i++)
49         {
50             for (int j=1; j<i; j++)
51             {
52                 T[k].begin=i,T[k].end=j;
53                 cin>>T[k].dis;
54                 T[k].dis+=a[i]+a[j];
55                 k++;
56             }
57             for (int j=i;j<=N;j++)
58             {
59                 int tmp;
60                 cin>>tmp;
61             }
62         }
63         sort(T+1,T+k,cmp);
64         int sum=0;
65         for (int i=1;i<k;i++)
66         {
67             //printf("%d ",T[i].dis);
68             if (find(T[i].begin)!=find(T[i].end))
69             {
70                 sum++;
71                 cnt+=T[i].dis;
72                 join(T[i].begin,T[i].end);
73                 if (sum==N-1) break;
74             }
75         }
76         printf("%d\n",cnt);
77     }
78     return 0;
79 }

ZOJ1586——QS Network(最小生成树)

时间: 2024-10-07 22:21:41

ZOJ1586——QS Network(最小生成树)的相关文章

QS Network(最小生成树)

题意:若两个QS之间要想连网,除了它们间网线的费用外,两者都要买适配器, 求使所有的QS都能连网的最小费用. 分析:这个除了边的权值外,顶点也有权值,因此要想求最小价值,必须算边及顶点的权值和. 解决方法:用prim算法,在构造邻接矩阵时,在i到j的权值的基础上再加上i点的权值和j点的权值即可. 附上AC代码: #include <stdio.h> #include <string.h> #include <stdlib.h> #define infinity 1000

ZOJ 1586 QS Network(最小生成树 prim)

题意  输入n  然后输入n个数  代表连接时每个站点自身的消耗   然后输入n*n的矩阵  第i行第j列的数代表第i个站点和第j个站点之间路上的花费  链接i,j两个节点的总花费为两站点自身花费加上路上的花费  求⑩这n个站点连通的最小总花费 又是裸的最小生成树  给点的就用prim咯 #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N = 10

ZOJ 1586 QS Network (经典MST~Prim)

链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=586 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 n

E - QS Network

E - QS Network 思路:最小生成树,数组不要开小了. #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define MAXN 100010 using namespace std; int t,n,tot,sum,ans; int fa[MAXN],mon[MAXN]; struct nond{ int x,y,z; }v[1000050]; i

FZU 1096 QS Network

QS Network Time Limit: 1000ms Memory Limit: 32768KB This problem will be judged on FZU. Original ID: 1096 64-bit integer IO format: %I64d      Java class name: Main In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS.

POJ 2349 Arctic Network 最小生成树题解

本题也是使用Prime和Kruskal都可以的最小生成树的题解. 本题一点新意就是:需要除去最大的S-1个距离,因为可以使用卫星覆盖这些距离. 技巧:建图建有向图,速度快点,不用计算两边. 这里使用Prime,因为是稠密图. #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <limits.h> #include <al

poj2349Arctic Network(最小生成树kruscal+第k长的边)

题目链接: 啊哈哈,点我点我 题意: 北极的某区域共有n座村庄( 1 ≤ n ≤ 500 ),每座村庄的坐标用一对整数(x, y)表示,其中 0 ≤ x, y ≤ 10000.为了加强联系,决定在村庄之间建立通讯网络.通讯工具可以是无线电收发机,也可以是卫星设备.所有的村庄都可以拥有一部无线电收发机, 且所有的无线电收发机型号相同.但卫星设备数量有限,只能给一部分村庄配备卫星设备.  不同型号的无线电收发机有一个不同的参数d,两座村庄之间的距离如果不超过d就可以用该型号的无线电收发机直接通讯,d

ZOJ QS Network (prime_裸题)

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.

ZOJ 1586 QS Network(kruskal)(基础)

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