Time Limit:1s | Memory limit:32M |
Accepted Submit:232 | Total Submit:750 |
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:
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.
The 1st line of the input contains an integer t which indicates the number of data sets. Constrains: all the integers in the input are non-negative and not more than 1000.
for each data set,output the minimum cost in a line. NO extra empty lines needed.
1 3 10 20 30 0 100 200 100 0 300 200 300 0
370 分析:prim算法是求最小生成树,是无向图,还要注意的是如果两点之间没有直接通路的话,这两点是可以直接相通的! code: #include<stdio.h> #define INF 32767 struct MGraph{ int n; int edges[1000][1000]; }; void CreatMGraph(MGraph &g) { int i,j; int a[1000]; scanf("%d%*c",&g.n); for(i=0;i<g.n;i++) scanf("%d%*c",&a[i]); for(i=0;i<g.n;i++) { for(j=0;j<g.n;j++) scanf("%d%*c",&g.edges[i][j]); } for(i=0;i<g.n;i++) { for(j=0;j<g.n;j++) { if(i!=j) g.edges[i][j]+=a[i]+a[j]; } } } void prim(MGraph &g) { int lowcost[1000]; int min; int sum=0; int closest[INF],i,j,k; for(i=0;i<g.n;i++) { lowcost[i]=g.edges[0][i]; closest[i]=0; } lowcost[0]=0; for(i=1;i<g.n;i++) { min=INF; //特别注意的地方 for(j=0;j<g.n;j++) if(lowcost[j]!=0&&lowcost[j]<min) { min=lowcost[j]; k=j; } sum+=min; lowcost[k]=0; for(j=0;j<g.n;j++) { if(g.edges[k][j]!=0&&g.edges[k][j]<lowcost[j]) { lowcost[j]=g.edges[k][j]; closest[j]=k; } } } printf("%d/n",sum); } int main() { register int i; int m,n; scanf("%d%*c",&m); for(i=0;i<m;i++) { MGraph g; CreatMGraph(g); prim(g); } return 0; } |