题目:
http://acm.hdu.edu.cn/showproblem.php?pid=6178
题意:
有一个树形图,有n个节点,每个节点只能呆一只猴子,现在有k只猴子,要求删掉一些边,在剩余的图中,把这些猴子放置在点上,要求任意一只猴子至少能沿着边访问到另外一只猴子。问最少还剩多少条边
思路:
可以发现,最少的剩余方式按两个点一条边这样的方式配对。可以用贪心的思想,首先从叶子节点开始配对,求出能配对的数量ans,如果配对数量*2 >= k,那么答案就是(k+1)/2,否则就是ans + k - ans*2
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10, INF = 0x3f3f3f3f;
struct node
{
int to, next;
}g[N*2];
int cnt, head[N];
int deg[N];
bool vis[N];
namespace IN
{
const int inBufferSize = 1<<25;
char inBuffer[inBufferSize];
char *inHead = NULL, *inTail = NULL;
inline char Getchar()
{
if(inHead == inTail)
inTail=(inHead=inBuffer)+fread(inBuffer, 1, inBufferSize, stdin);
return *inHead++;
}
}
#define getchar() IN::Getchar()
template <typename T>
inline void scan_ud(T &ret)
{
char c = getchar();
ret = 0;
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 + (c - '0'), c = getchar();
}
void init()
{
cnt = 0;
memset(head, -1, sizeof head);
memset(deg, 0, sizeof deg);
}
void add_edge(int v, int u)
{
g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
int bfs(int n)
{
queue<int> que;
memset(vis, 0, sizeof vis);
for(int i = 1; i <= n; i++)
if(deg[i] == 1) que.push(i), deg[i] = 0;
int ans = 0;
while(! que.empty())
{
int v = que.front(); que.pop();
for(int i = head[v]; ~i; i = g[i].next)
{
int u = g[i].to;
if(!vis[v] && !vis[u])
{
vis[v] = vis[u] = true;
ans++;
}
if(--deg[u] == 1) que.push(u);
}
}
return ans;
}
int main()
{
int t, n, m;
//scanf("%d", &t);
scan_ud(t);
while(t--)
{
init();
//scanf("%d%d", &n, &m);
scan_ud(n); scan_ud(m);
int x;
for(int i = 1; i <= n-1; i++)
{
//scanf("%d", &x);
scan_ud(x);
add_edge(x, i+1); add_edge(i+1, x);
deg[x]++, deg[i+1]++;
}
int ans = bfs(n);
printf("%d\n", ans * 2 >= m ? (m+1)/2 : ans + m - ans*2);
}
return 0;
}