You're given a tree with nn vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
The first line contains an integer nn (1≤n≤1051≤n≤105) denoting the size of the tree.
The next n−1n−1 lines contain two integers uu, vv (1≤u,v≤n1≤u,v≤n) each, describing the vertices connected by the ii-th edge.
It's guaranteed that the given edges form a tree.
Output a single integer kk — the maximum number of edges that can be removed to leave all connected components with even size, or −1−1if it is impossible to remove edges in order to satisfy this property.
4 2 4 4 1 3 1
1
3 1 2 1 3
-1
10 7 1 8 4 8 10 4 7 6 5 9 3 3 5 2 10 2 5
4
2 1 2
0
In the first example you can remove the edge between vertices 11 and 44. The graph after that will have two connected components with two vertices in each.
In the second example you can't remove edges in such a way that all components have even number of vertices, so the answer is −1−1
题意:给一棵树,问最多能删去多少条边,使得每个联通块的内点的个数均为偶数
思路:深搜,深搜时统计该节点及其子树节点总数。若为偶数,则该边可删。
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n,m;
vector <int> Map[maxn];
int visit[maxn];
int ans = 0;
int dfs(int pos){
int ret = 0;
for (int i=0; i<Map[pos].size(); i++){
int tmp = Map[pos][i];
if (!visit[tmp]){
visit[tmp] = 1;
int tcnt = dfs(tmp);
if (tcnt % 2)
ans++;
ret += tcnt;
}
}
return ret+1;
}
int main(){
scanf("%d%d",&n, &m);
int a,b;
for (int i=0; i<m; i++){
scanf("%d%d",&a, &b);
Map[a].push_back(b);
Map[b].push_back(a);
}
if (n%2){
cout<<-1<<endl;
return 0;
}
visit[1] = 1;
int tot = dfs(1);
cout<<ans<<endl;
}