Codeforces Round #748 (Div. 3)
题意
给一棵n个节点n-1条边的树,每次删掉所有的叶子节点,操作k次,求剩下的节点数。
思路
类拓扑排序。先把度数 ≤ \le ≤ 1的节点入队列,然后进行遍历。建立一个d数组统计每个节点到根节点的层数。最后遍历d数组求出小于k的节点数。剩下的节点即为所求节点。
#include<bits/stdc++.h>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
//#define O2 #pragma GCC optimize(2)
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 4e5 + 7, M = 1e6;
vector<int> v[N];
queue<int> q;
int deg[N], d[N];
void dfs()
{
while (q.size())
{
int x = q.front(); q.pop();
for (int i = 0; i < v[x].size(); i++)
{
int y = v[x][i];
if (deg[y] <= 1) continue;
d[y] = d[x] + 1;
if (--deg[y] <= 1) q.push(y);
}
}
}
int main()
{
IOS;
int T; cin >> T;
while (T--)
{
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i++) v[i].clear(), deg[i] = 0;
for (int x, y, i = 1; i < n; i++)
{
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
deg[x]++; deg[y]++;
}
for (int i = 1; i <= n; i++)
if (deg[i] <= 1) q.push(i), d[i] = 1;
dfs();
int ans = 0;
for (int i = 1; i <= n; i++)
if (d[i] <= k) ans++;
cout << n - ans << endl;
}
return 0;
}