模拟求root——cf1067B

注意最后一轮要单独求一下

且最后只能有一个root

#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007
#define ll long long int
#define vi vector<int>
#define vii vector< vector<int> >
#define PI 3.1415926535897932384626433832795
#define INF 9223372036854775807LL
#define endl "\n"

int deg[];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n,k;
    cin >> n >> k;
    vii graph(n+,vi());
    vector<bool> rem(n+,false);
    for(int i = ; i < n-; i++) {
        int a,b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    if(k > ) {
        cout << "No";
        return ;
    }
    while(k > ) {
        for(int i = ; i <= n; i++) {//扫一遍剩下的图，求度数
            if(!rem[i]) {
                for(int u : graph[i]) {
                    if(!rem[u]) {
                        deg[i]++;
                    }
                }
            }
        }
        for(int i = ; i <= n; i++) {//扫一遍剩余结点
            if(!rem[i]) {
                int leafcn = ;
                for(int u : graph[i]) {
                    if(!rem[u] && deg[u] == ) {//找到了新的叶子
                        leafcn++;
                    }
                }
                if(leafcn <  && leafcn != ) {//u有儿子且小于3
                    cout << "No";
                    return ;
                }
            }
        }
        for(int i = ; i <= n; i++) {//把叶子删了
            if(!rem[i] && deg[i] == ) {
                rem[i] = true;
            }
        }
        memset(deg,,sizeof(deg));
        k--;
    }

    int cn = ;
    int cnb = ;
    for(int i = ; i <= n; i++) {//最后还要再求一次
        if(!rem[i]) {
            cn++;
            for(int u : graph[i]) {
                if(!rem[u]) {
                    deg[i]++;
                }
            }
            if(deg[i] != ) {
                cnb++;
            }
        }
    }
    if(cn <  || cnb != ) {
        cout << "No";
    } else {
        cout << "Yes";
    }
    return ;
}