zoj1586 QS Network(最小生成树)
来源:互联网 发布:java脚本返回上一页 编辑:程序博客网 时间:2024/06/08 13:40
QS Network
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
/*最小生成树简单变形,将边权值加上相邻的俩个点权值直接求就行,,颓废了几天,,,,,,加油!!!Time:2015-1-15 21:41*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int MAX=1010;const int INF=0x3f3f3f3f;int p[MAX];int g[MAX][MAX];int n;int dis[MAX];bool vis[MAX];int Prim(){ for(int i=0;i<=n;i++){ dis[i]=g[1][i]; vis[i]=0; } int Mst=0;vis[1]=true; for(int i=0;i<=n;i++){ int u=1,minV=INF; for(int j=1;j<=n;j++){ if(!vis[j]&&minV>dis[j]){ minV=dis[j]; u=j; } } vis[u]=true; if(minV==INF) return Mst; Mst+=dis[u]; for(int j=1;j<=n;j++){ if(!vis[j]&&dis[j]>g[u][j]){ dis[j]=g[u][j]; } } }}int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&p[i]); } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ scanf("%d",&g[i][j]); if(i!=j) g[i][j]=(g[i][j]+p[i]+p[j]); } }/* for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ printf(" %d",g[i][j]); }puts(""); }*/ printf("%d\n",Prim()); }return 0;}
- zoj1586 QS Network(最小生成树)
- zoj1586 QS Network(最小生成树)
- ZOJ1586 QS Network
- ZOJ1586 QS Network
- QS Network-ZOJ1586
- ZOJ1586 QS Network
- zoj 1586 QS Network 最小生成树
- 【最小生成树】QS Network ZOJ 1586
- ZOJ QS Network(最小生成树)
- ZOJ 1586 QS Network 最小生成树
- zoj 1586 QS Network(最小生成树)
- QS Network(最小生成树)
- QS Network 【zoj-1586】【最小生成树】
- ZOJ 1586 QS Network(最小生成树)
- ZOJ-1586 QS Network (最小生成树)
- zoj 1586 QS Network (最小生成树)
- ZOJ - 1586 QS Network (最小生成树 Kruskal)
- zoj 1586 QS Network(最小生成树))
- 信息类专业国际会议/期刊影响因子汇总
- SharedPreferences的使用
- android out of memory(OOM)产生原因
- 黑马程序员——Java基础---抽象类和接口的区别
- Android ViewPager用法
- zoj1586 QS Network(最小生成树)
- c语言中注意细节
- Apache DBUtils使用总结
- 随想录(一个android原生app的代码赏析)
- OC日期与时间
- nginx启动初始化过程(二)
- HDU2078 复习时间【水题】【数学】
- 哈希查找中的除法取余时负数处理
- Android startActivityForResult的使用