Repository navigation
Expand file tree
/
Copy patheven_tree.cpp
More file actions
61 lines (49 loc) · 1.43 KB
/
Copy patheven_tree.cpp
File metadata and controls
61 lines (49 loc) · 1.43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int countNodes(const vector<vector<int>>& edges, vector<int>& numNodes, int src, int parent) {
int result = 1;
for (int tgt: edges[src]) {
if (tgt == parent) {
continue;
}
result += countNodes(edges, numNodes, tgt, src);
}
return numNodes[src] = result;
}
// greedily remove edges
void traverse(const vector<vector<int>>& edges, const vector<int>& numNodes, int src, int parent, int& result) {
for (int tgt: edges[src]) {
if (tgt == parent) continue;
if (numNodes[tgt] % 2 == 0) { // they can live
++result;
}
traverse(edges, numNodes, tgt, src, result);
}
}
int solve(const vector<vector<int>>& edges) {
// start from node 0 and construct spanning tree
// keep track of number of nodes in subtree
vector<int> numNodes(edges.size(), -1);
countNodes(edges, numNodes, 0, -1);
int result = 0;
traverse(edges, numNodes, 0, -1, result);
return result;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> edges(n);
for (int i = 0; i < m; ++i) {
int src, dst;
cin >> src >> dst;
--src;--dst;
edges[src].push_back(dst);
edges[dst].push_back(src);
}
cout << solve(edges) << endl;
return 0;
}