计蒜客 Tree

2017icpc        shenyang

树上边的常规操作，将无根树理解为一个遍连接着两个树。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const int maxm = 400005;
int tot,ver[maxm],he[maxn],ne[maxm],sz[maxn],k;
void add( int x,int y ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
}
int ans,n;
void dfs( int x,int fa ){
    sz[x]  =1;
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y = ver[cure];
        if( y == fa ) continue;
        dfs( y,x );
        sz[x] += sz[y];
    }
    if( sz[x] >= k && n-sz[x] >= k ) ans++;
}
int main(){
    int T,x,y;
    scanf("%d",&T);
    while(T--){
        ans = 0;tot = 1;
        scanf("%d%d",&n,&k);
        for( int i = 0;i <= n;i++ ) he[i] = 0;
        for( int i =1;i <= n-1;i++ ){
            scanf("%d%d",&x,&y);
            add(x,y);add(y,x);
        }
        dfs(1,0);
        printf("%d\n",ans);
    }
    return 0;
}