思路:
- 最小生成树,唯一特殊在于 mp[i][j] = w + p[i] + p[j] 。
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1005;
int N;
int ans;
int mp[maxn][maxn];
int p[maxn];
bool vis[maxn];
int dis[maxn];
struct NODE{
int id;
int dis;
friend bool operator > (NODE a , NODE b)
{
return a.dis > b.dis;
}
NODE(int id,int dis) : id(id) , dis(dis) {} ;
};
priority_queue <NODE , vector<NODE> , greater<NODE> > Q;
void INIT(){
ans = 0;
memset(vis , 0 , sizeof(vis));
memset(dis , INF , sizeof(dis));
return ;
}
void PRIM(){
dis[1] = 0;
Q.push(NODE(1 , 0));
while(Q.size()){
NODE cur = Q.top() ; Q.pop() ;
int id = cur.id ;
if(vis[id])
continue;
ans += dis[id];
vis[id] = true;
for(int i=1;i<=N;i++)
if(!vis[i] && dis[i] > mp[id][i]){
dis[i] = mp[id][i];
Q.push(NODE(i , dis[i]));
}
}
return ;
}
int main(){
int T;cin>>T;
while(T--){
INIT();
cin>>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++){
int w;
scanf("%d" , &w);
mp[i][j] = w + p[i] + p[j] ;
}
PRIM();
cout<<ans<<endl;
}
return 0;
}