FOJ--1096--QS Network--解题报告
2009-08-08 09:30
141 查看
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
Sample Output
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
分析:用prim算法,求最小生成树
代码如下:
#include <stdio.h> #include <string.h> #define MAX 1000 #define MAXCOST 10000 int sum; void Prim(int graph[][MAX],int n,int prist[]) { int i,j,k,min; int lowcost[MAX]; int adjvex[MAX]; for(i=1;i<n;i++) lowcost[i]=graph[0][i]+prist[0]+prist[i]; memset(adjvex,0,sizeof(adjvex)); min=MAXCOST; for(i=1;i<n;i++) { min=MAXCOST; for(j=1;j<n;j++) if(adjvex[j]==false && lowcost[j]<min) { min=lowcost[j]; k=j; } adjvex[k]=true; for(j=1;j<n;j++) { if(adjvex[j]==false && lowcost[j]>graph[k][j]+prist[j]+prist[k]) lowcost[j]=graph[k][j]+prist[j]+prist[k]; } } for(i=1;i<n;i++) sum+=lowcost[i]; } int main() { int n,m,i,j; int graph[MAX][MAX]; int prist[MAX]; scanf("%d",&m); while (m--) { scanf("%d",&n); sum=0; for(i=0;i<n;i++) scanf("%d",&prist[i]); for(i=0;i<n;i++) for(j=0;j<n;j++) { scanf("%d",&graph[i][j]); if(i==j) graph[i][j]=MAXCOST; } Prim(graph,n,prist); printf("%d/n",sum); } return 0; }[/code]
相关文章推荐
- FOJ--1635--Commandos--解题报告
- FOJ--1409--文件压缩--解题报告
- FOJ--1490--五子棋--解题报告
- POJ - 1459 Power Network解题报告(网络流最大流 超级源点建图)
- FOJ1650-A^B mod C解题报告
- TYVJ 1096 数字组合 解题报告
- FOJ--1573--大学自习室--解题报告
- FOJ--1339--Calculator--解题报告
- FOJ--1698--最大乘积--解题报告(大数乘小数的问题)
- Uva 1267 Network 解题报告(贪心搜索)
- poj 1861 Network 解题报告
- FOJ--1629--Above Average--解题报告
- FOJ 2013 A short problem 解题报告
- poj 1861 Network 解题报告
- FOJ--1733--Image Distortion--解题报告
- FOJ--1589--自动机--解题报告
- 【Jason's_ACM_解题报告】Network
- POJ-1861-NETWORK 解题报告
- POJ-1861-Network 解题报告
- HDU 1089 ~ 1096 A+B for Input-Output Practice 解题报告 C语言