HDU6178

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
namespace fastIO {
    #define BUF_SIZE 500000
    //fread -> read
    bool IOerror = 0;
    inline char nc() {
        static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
        if(p1 == pend) {
            p1 = buf;
            pend = buf + fread(buf, 1, BUF_SIZE, stdin);
            if(pend == p1) {
                IOerror = 1;
                return -1;
            }
        }
        return *p1++;
    }
    inline bool blank(char ch) {
        return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
    }
    inline void read(int &x) {
        char ch;
        while(blank(ch = nc()));
        if(IOerror)
            return;
        for(x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0');
    }
    #undef BUF_SIZE
};
using namespace fastIO;

const int N = 1E5 + 7;

vector<int> tree[N];
bool vis[N];
int cnt;
void dfs(int now, int pre)
{
    for(auto it : tree[now]) {
        if(it == pre) continue;
        dfs(it, now);
        if(!vis[it]) {
            if(vis[now]) cnt ++;
            else vis[it] = vis[now] = 1;
        }
    }
}
int main()
{
    int T;
    read(T);
    while(T --) {
        int n, k;
        cnt = 0;
        read(n), read(k);
        memset(vis, false, sizeof(vis));
        for(int i = 0;i <= n;i ++) tree[i].clear();
        for(int i = 2;i <= n;i ++) {
            int u;
            read(u);
            tree[i].push_back(u);
            tree[u].push_back(i);
        }
        dfs(1, -1);
        cnt += (!vis[1]);
        int ok = (n - cnt) / 2, ans;
        if(2 * ok < k) {
            ans = ok + k - 2 * ok;
        } else if(k & 1) {
            ans = (k + 1) / 2;
        } else {
            ans = k / 2;
        }
        printf("%d\n", ans);
    }
    return 0;
}

利用从子叶回溯求能把树最多拆分成多少点-边-点。然后贪心下