传送门
题意
给出一棵 n n n个节点组成的树,问选出 k k k个节点满足相互之间距离相等的方案数有多少
分析
借鉴这个大佬的思路
首先
k
=
=
2
k == 2
k==2的情况还是比较好特判的
剩下的,我们可以去构造一个根结点
r
o
o
t
root
root,如果
k
k
k个满足
d
i
s
(
a
i
,
r
o
o
t
)
=
=
d
i
s
(
a
j
,
r
o
o
t
)
dis(a_{i},root) == dis(a_{j},root)
dis(ai,root)==dis(aj,root),那么就可以保证他们之间的距离相等,但是有一个前提条件就是,
L
C
A
(
a
i
,
a
j
)
=
=
r
o
o
t
LCA(a_{i},a_{j}) == root
LCA(ai,aj)==root,怎么做到这一点呢,上面那个佬给的思路很棒,我们可以把
r
o
o
t
root
root的每一个子树单独拿出来,只要每一个子树在同样的深度最多只选择一个点,那么一定能保证选中的这些点的
L
C
A
LCA
LCA为root,子树选点的方案数计算可以用
D
P
DP
DP来解决
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e2 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],e[M],ne[M],idx;
ll cnt[N][110];
ll f[N][110];
int n,k;
void add(int x,int y){
ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}
void dfs(int u,int fa,int root,int d){
cnt[root][d]++;
for(int i = h[u];~i;i = ne[i]){
int j = e[i];
if(j == fa) continue;
dfs(j,u,root,d + 1);
}
}
ll res(vector<int> p){
memset(f,0,sizeof f);
int x = p.size() - 1;
f[0][0] = 1;
for(int i = 1;i <= x;i++)
for(int j = 0;j <= i;j++){
if(j){
f[i][j] = f[i - 1][j - 1] * p[i];
}
f[i][j] += f[i - 1][j];
f[i][j] %= mod;
}
return f[x][k];
}
int main() {
int T;
read(T);
while(T--){
memset(h,-1,sizeof h);
idx = 0;
read(n),read(k);
for(int i = 1;i < n;i++){
int a,b;
read(a),read(b);
add(a,b),add(b,a);
}
if(k == 2){
di(n * (n - 1) / 2);
continue;
}
ll ans = 0;
for(int i = 1;i <= n;i++){
memset(cnt,0,sizeof cnt);
for(int j = h[i];~j;j = ne[j]){
int k = e[j];
dfs(k,i,k,1);
}
VI son;
for(int j = 1;j <= n;j++){
son.clear();
son.pb(-1);
for(int x = h[i];~x;x = ne[x]){
int y = e[x];
son.pb(cnt[y][j]);
}
ans += res(son);
ans %= mod;
}
}
dl(ans);
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/