cf1777 D. Score of a Tree(思维)

#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
#define debug cout<<"debug"<<endl
mt19937 rd(time(0));
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
const double eps = 1e-8;
const double PI = 3.14159265358979323;
const int N = 2e5+10, M = 2*N, mod = 1e9+7;
const int INF = 0x3f3f3f3f;

int n;
int h[N], e[N], ne[N], idx;
int d[N], pow2[N];

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

void dfs(int u, int fa)
{
    // d为节点i最远叶子节点的深度, 表示在第d轮后该节点永远变为0
    // 对于可以变1的节点, 每轮有1/2的概率变1, 最终贡献为2^(n-1), 找到每轮能变1节点总和即可
    d[u] = 1;
    for(int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if(j == fa) continue;
        dfs(j, u);
        d[u] = max(d[u], d[j]+1);
    }
}
void solve()
{
    cin>>n;
    memset(h, -1, sizeof h);
    for(int i = 1; i<n; i++)
    {
        int a, b; cin>>a>>b;
        add(a, b), add(b, a);
    }
    dfs(1, -1);
    ll res = 0;
    for(int i = 1; i<=n; i++) res = (res+d[i]) % mod;
    cout<<(ll)pow2[n-1]*(ll)res%mod<<endl;
}

int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T;
    T = 1;
    pow2[0] = 1;
    for(int i = 1; i<N; i++) pow2[i] = (ll)pow2[i-1]*2ll%mod;
    cin>>T;
    while(T -- )
    {
        solve();
    }
    return 0;
}