题意:
分析:
这道题一看就是个求类似最小生成树的东西,难点在于每个边加上去之后和h(i)有关的参数怎么改变。
一开始每个边都没加进去,初始的花费就是Σh[i]*(b[i]+a[i]-1)*(a[i]-b[i])/2.
然后考虑必须加的边(i, j),贪心的想一下,要么先满足i,再满足j,要么先满足j,再满足i,两者取min.
如果先i后j,那么花费为h[i]*b[j]*(a[i]-b[i])+h[j]*a[i]*(a[j]-b[j]),想一想,为什么。
之后是对于每个没有加进去的边,权值为r*(b[i]+b[j])+min(先i后j,先j后i).
求最小生成树即可。
最后记得用long long(Cena好像%lld不给过,必须用%I64d...)
#include <cstdio>
#include <algorithm>
using namespace std;
#define cs(i) h[i]*(b[i]+a[i]-1)*(a[i]-b[i])/2
#define cst(i,j) h[i]*b[j]*(a[i]-b[i])+h[j]*a[i]*(a[j]-b[j])
typedef long long ll;
const int N = 55;
char s[N];
int n,tt;
ll ans,r,a[N],b[N],h[N],f[N],mat[N][N];
struct ed {
int x, y;
ll w;
bool operator < (const ed &rhs) const {
return w < rhs.w;
}
}e[2505];
int fnd(int x) {
return f[x] == x ? x : f[x] = fnd(f[x]);
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%lld", &b[i]);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
for(int i = 1; i <= n; i++) scanf("%lld", &h[i]);
for(int i = 1; i <= n; i++) f[i] = i, ans += cs(i);
for(int i = 1; i <= n; i++) {
scanf("%s", s+1);
for(int j = i+1; j <= n; j++) if(s[j]=='Y')f[fnd(i)]=fnd(j),mat[i][j]=1,ans+=min(cst(i,j),cst(j,i));
}
scanf("%lld", &r);
for(int i = 1; i <= n; i++)
for(int j = i+1; j <= n; j++)
if(!mat[i][j]) e[++tt].x = i, e[tt].y = j, e[tt].w = r*(b[i]+b[j])+min(cst(i,j), cst(j,i));
sort(e+1, e+1+tt);
for(int i = 1; i <= tt; i++) if(fnd(e[i].x) != fnd(e[i].y))
f[fnd(e[i].x)] = fnd(e[i].y), ans += e[i].w;
printf("%lld\n", ans);
return 0;
}