E - QS Network
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
Submit Status
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
把配置器的价格直接加入图中的权值里，后面就是模板了
1 #include <stdio.h>
2 #include <string.h>
3 #include <algorithm>
4 using namespace std;
5 const int N=1010;
6 const int inf=1<<29;
7 int n,m,a[N],flag[N],w[N][N],dis[N];
8 int prim()
9 {
10 int sum=0;
11 memset(flag,0,sizeof(flag));
12 for(int i=1;i<=n;i++)
13 {
14 dis[i]=w[1][i];
15 }
16 flag[1]=1;
17 for(int i=1;i<n;i++)
18 {
19 int to=-1,min1=inf;
20 for(int j=1;j<=n;j++)
21 {
22 if(!flag[j]&&dis[j]<min1)
23 {
24 to=j;
25 min1=dis[j];
26
27 }
28 }
29 if(to==-1) return -1;
30 sum+=min1;
31 flag[to]=1;
32 for(int i=1;i<=n;i++)
33 {
34 dis[i]=min(dis[i],w[to][i]);
35 }
36 }
37 return sum;
38 }
39 int main()
40 {
41 int t, tmp;
42 scanf("%d",&t);
43 while(t--)
44 {
45 scanf("%d",&n);
46 for(int i=1;i<=n;i++)
47 {
48 scanf("%d",&a[i]);
49 }
50 for(int i=1;i<=n;i++)
51 {
52 for(int j=1;j<=n;j++)
53 {
54 scanf("%d",&tmp);
55 w[i][j] = tmp + a[i] + a[j];
56 w[j][i] = tmp + a[i] + a[j];
57 }
58 }
59 printf("%d\n",prim());
60 }
61 return 0;
62 }