商业街
思路:
又打井又修路,感觉很不爽,不妨把打井也看成修路,修一条等同于打井代价的路到一个水源。
这样就是一个裸的最小生成树了,注意要加入n次哟。
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 100010
using namespace std;
int n, m, ans=0;
int a[N], head[N], idc=0;
int fa[N], tot=0;
struct Edge{
int nxt,to,dis,from;
}ed[N * 40];
bool cmp(struct Edge a,struct Edge b){ return a.dis<b.dis;}
int findfa(int x){
return fa[x]==x ? fa[x] : fa[x]=findfa(fa[x]);
}
void adde(int u, int v, int dis){
ed[++idc].nxt = head[u];
ed[idc].from = u;
ed[idc].to = v;
ed[idc].dis = dis;
head[u] = idc;
}
int main(){
scanf("%d", &n);
for(int i=1; i<=n; i++){
scanf("%d", &a[i]);
adde(0, i, a[i]);
}
for(int i=1; i<=n; i++) fa[i] = i;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
int cc; scanf("%d", &cc);
if(i == j) continue;
adde(i, j, cc);
}
}
sort(ed+1, ed+idc+1, cmp);
for(int i=1; i<=idc; i++){
int x = findfa(ed[i].from), y = findfa(ed[i].to);
if(x != y){
tot++;
fa[y] = x;
ans += ed[i].dis;
}
if(tot == n) break;
}
printf("%d\n", ans);
return 0;
}