-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPT07Y.cpp
70 lines (62 loc) · 1.28 KB
/
PT07Y.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
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
// #define OJ
bool cycle(int node, int prev, int &edges, vector<bool> &visited, vector<vector<int>> &graph)
{
if (visited[node])
return true;
edges++;
visited[node] = true;
for (int adj : graph[node])
{
if (adj == prev)
continue;
if (cycle(adj, node, edges, visited, graph))
return true;
}
return false;
}
void solve()
{
int n, m;
cin >> n >> m;
if (m != n - 1)
{
cout << "NO";
return;
}
vector<bool> visited(n + 1, false);
vector<vector<int>> graph(n + 1);
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
int edges = 0;
if (cycle(1, 0, edges, visited, graph))
cout << "NO";
else
{
// cout << "else" << edges << endl;
if (edges == n)
cout << "YES";
else
cout << "NO";
}
}
int main()
{
fast_cin();
#ifndef OJ
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
return 0;
}