-
Notifications
You must be signed in to change notification settings - Fork 1
/
Happy Vertices.cpp
57 lines (55 loc) · 1.22 KB
/
Happy Vertices.cpp
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
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fr(i, a, n) for (int i = a; i < n; i++)
#define fre(i, a, b) for (int i = a; i <= b; i++)
#define endl '\n'
#define no cout << "NO" << endl
#define yes cout << "YES" << endl
#define mem(name, value) memset(name, value, sizeof(name))
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define case cout << "Case " << t++ << ": ";
vector <int> Graph[100005];
int color[100005],
child[100005],
parent[100005];
void dfs(int v) {
color[v] = 1;
for(auto u : Graph[v]) {
if(color[u] == 0) {
parent[u] = v;
child[v]++;
dfs(u);
}
}
color[v] = 2;
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, m, a, b, ans = 0;
cin >> n >> m;
while(m--){
cin >> a >> b;
Graph[a].pb(b);
Graph[b].pb(a);
}
fr(i, 1, n+1){
dfs(i);
}
fr(i, 1, n+1){
if(parent[i] != 0){
if(child[parent[i]] < child[i]) ans++;
}
}
cout << ans << endl;
}