cf 1401D - Maximum Distributed Tree
题目链接
做法 : 深搜(记录当前边下节点个数, 来统计对答案产生贡献的次数) + 贪心 (将最大的乘积赋值给对于答案产生最多次贡献的边,其他顺次给)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int N= 1e5+10;
const int mod = 1e9+7;
map<pii, int> mp;
vector<int> son[N];
pli w[N];
int p[N];
int n, m;
void dfs(int u, int fa) {
int e = mp[{max(u, fa), min(u, fa)}];
w[e].first = 1;
for(auto v : son[u]) {
if(v == fa) continue;
dfs(v, u);
int ee = mp[{max(u, v), min(u, v)}];
w[e].first += w[ee].first;
}
}
int Plus(ll a, ll b) {
return a + b >= mod ? a+b - mod : a+b;
}
int Mul(ll a, ll b) {
return a * b % mod;
}
void init() {
for(int i = 1; i <= n + 1; i++) son[i].clear();
mp.clear();
}
int main() {
int T;
scanf("%d", &T);
while(T -- ) {
scanf("%d", &n);
n--;
for(int i = 1; i <= n; i++) {
int u, v;
scanf("%d%d", &u, &v);
mp[{max(u, v), min(u,v)}] = i;
son[u].push_back(v);
son[v].push_back(u);
w[i].second = i;
}
scanf("%d", &m);
for(int i = 1; i <= m; i++) scanf("%d", &p[i]);
sort(p+1, p+1+m);
dfs(1, 0);
for(int i = 1; i <= n; i++) {
w[i].first = w[i].first * (n+1 - w[i].first);
}
sort(w+1, w+1+n);
ll ans = 0;
if(m < n) {
int i = n, j = m;
for( ; j; i--, j --) {
ans =Plus(ans, Mul(w[i].first, p[j]));
}
while(i) {
ans = Plus(ans, Mul(w[i].first, 1));
i--;
}
}
else {
int i ,j;
for(i = 1, j = 1; i < n; i++, j++) {
ans = Plus(ans, Mul(w[i].first, p[j]));
}
ll add = w[n].first;
for(j; j <= m; j++) {
add = Mul(add, p[j]);
}
ans = Plus(add, ans);
}
// printf("********");
printf("%lld\n", ans);
init();
}
return 0;
}