P1550 [USACO08OCT]Watering Hole G - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
有n个牧场,已知在每个牧场单独挖个井的代价,和每个牧场间修建道路的代价,求使得每个牧场都能与井连通的最小代价 === 最小生成树
#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <sstream>
#include <unordered_map>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <string>
#include <cstring>
#define x first
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef long long LL;
typedef unsigned long long ULL;
const int N=400 , INF = 1e9 ;
struct edge{
int a,b,v;
bool operator <(const edge &W) const
{
return v > W.v;
}
};
priority_queue<edge> q;
int n,w[N],res;
int p[N];
int st[N][N];
int find(int x)
{
if(p[x] != x ) p[x] = find(p[x]);
return p[x];
}
int kruskal()
{
while(q.size())
{
auto t = q.top();q.pop();
int a = find(t.a),b=find(t.b);
if(a != b)
{
p[p[b]] = p[a];
res += t.v;
}
}
return res;
}
void solve()
{
cin>>n;
for(int i=1;i<=n;i ++ )cin>>w[i];
for(int i=1;i<=n;i ++ )
for(int j=1;j<=n;j ++ )
{
int t;cin>>t;
st[i][j] =t;
if(i!= j)
q.push({i,j,t});
}
n ++ ;
// n + 1 号点为根节点
for(int i=1;i<n;i ++ )
{
q.push({i,n,w[i]});
q.push({n,i,w[i]});
}
for(int i=1;i<=n;i ++ )p[i] = i;
cout<< kruskal() << endl;
}
int main()
{
ios
int T=1;
// cin>>T;
while(T -- )
{
solve();
}
return 0;
}