zoj 1586 QS Network (Prim~)

好糾結啊。。。這題蠻水的。。。。把買adopters的費用加到map裡就行了。。。很順利滴寫完了。。交了。。WA.。。

 

查了半天錯。。。i j寫錯了。。。我了個去啊。。。以後不用i j 了，我用i k。。。。

 

#include <stdio.h><br />#include <stdlib.h><br />#include <iostream><br />#include <limits.h><br />const int N = 1002;<br />using namespace std;<br />int map[N][N],n;<br />void input()<br />{<br />int i,j,cost[N],value;<br />cin >> n;<br />for(i=1; i<=n; i++)<br />cin >> cost[i];<br />for(i=1; i<=n; i++)<br />for(j=1; j<=n; j++)<br />{<br />map[i][j] = 0;<br />cin >> value;<br />if( i == j )<br /> continue;<br />map[i][j] = ( value + cost[j] + cost[i]);<br />}<br />}<br />void prim()<br />{<br />int hash[N],dis[N],i,j,sum = 0,now,min;<br />for(i=1; i<=n; i++)<br />{<br />hash[i] = 0;<br />dis[i] = INT_MAX;<br />}<br />now = 1; dis[now] = 0; hash[now] = 1;<br />for(i=1; i<n; i++)<br />{<br />for(j=1; j<=n; j++)<br />if( !hash[j] && dis[j] > map[now][j] )<br />dis[j] = map[now][j];<br />min = INT_MAX;<br />for(j=1; j<=n; j++)<br /> if( !hash[j] && dis[j] < min )<br /> min = dis[now = j];<br />hash[now] = 1;<br />sum += min;<br />}<br />cout << sum << endl;<br />}<br />int main(void)<br />{<br />int ncases;<br />cin >> ncases;<br />while( ncases-- )<br />{<br />input();<br />prim();<br />}<br />return 0;<br />}<br />