zoj 1586 QS Network【kruskal】
来源:互联网 发布:淘宝子账号没有二维码 编辑:程序博客网 时间:2024/05/22 11:53
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
Author: JIANG, Jiefeng
Source: Zhejiang University Local Contest 2003, Preliminary
//2605331 2011-07-29 16:46:54 Accepted 1586 C++ 160 6048 ylwh!#include <stdio.h>#include <string.h>#include <stdlib.h>#include <math.h>#include <ctype.h>#include <algorithm>#define N 1001#define LEN (N*N-N) / 2 + 1using namespace std;struct edge{int x, y, cost;}map[LEN];int n, len, root[N];bool cmp(struct edge a, struct edge b){return a.cost < b.cost;}void input(){int price[N], i, j, temp;int count=1;scanf("%d", &n);len = (n*n - n) / 2;for(i=1; i<=n; i++)scanf("%d", &price[i]);for(i=1; i<=n; i++)for(j=1; j<=n; j++){scanf("%d", &temp);if(i<j){map[count].x = i;map[count].y = j;map[count].cost = price[i] + price[j] + temp;count++;}}}int find_set(int x){while(x != root[x])x = root[x];return x;}void KRUSKAL(){int i, a, b, sum=0;for(i=1; i<=n; i++)root[i] = i;sort(map+1, map+len+1, cmp);for(i=1; i<=len; i++){a = find_set( map[i].x );b = find_set( map[i].y );if(a != b){root[b] = a;sum += map[i].cost;}}printf("%d\n", sum);}int main(){int t;scanf("%d", &t);while(t--){input();KRUSKAL();} return 0;}
- zoj 1586 QS Network【kruskal】
- ZOJ 1586QS Network(kruskal)(基础)
- ZOJ - 1586 QS Network (最小生成树 Kruskal)
- zoj 1586 QS Network【最小生成树 kruskal && prim】
- ZOJ 1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- ZOJ 1586 QS Network
- ZOJ-1586-QS Network
- ZOJ:1586 QS Network
- zoj 1586 QS Network
- ZOJ-1586 QS Network
- zoj -1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- ZOJ 1586 QS Network
- zoj 1586 QS Network
- zoj 1586 QS Network
- Android中动态添加控件需要注意的事情
- 给图片加上倒影
- 批量把文件编码由GBK转为UTF8
- ContentProvider原理分析二 MediaProvider publish
- Android数据存储-SharedPreferences
- zoj 1586 QS Network【kruskal】
- xampp的mysql允许远程访问
- poj 3895 【无向图最大环】
- 纯CSS下拉导航代码
- 内部类调用
- 检查新同事的代码时发现的问题
- MySQL 字符集相关问题
- 显示ip地理位置信息
- 解决问题的途径—论坛