#include<bits/stdc++.h>
using namespace std;
const int maxn=1010;
bool moze=true;
vector<int> g[maxn];
int dfs(int node,int par=1,int parent=-1){
int ret=0;
int klk=0;
for(int i:g[node]){
if(i==parent) continue;
auto temp=dfs(i,par^1,node);
ret=max(ret,temp);
if(temp>2) klk++;
}
if(klk>2) moze=false;
ret++;
return ret;
}
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++){
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
if(m!=n-1){
cout<<"NO\n";
return 0;
}
dfs(1);
if(moze) cout<<"YES\n1\n1";
else cout<<"NO\n";
return 0;
}
/*
7 6
1 2
1 3
1 4
1 5
1 6
1 7
6 6
1 2
2 3
3 1
1 4
2 5
3 6
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
324 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Correct |
1 ms |
324 KB |
Output is correct |
8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
320 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
21 |
Partially correct |
1 ms |
328 KB |
Failed to provide a successful strategy. |
22 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
23 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
24 |
Partially correct |
1 ms |
328 KB |
Failed to provide a successful strategy. |
25 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
26 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
27 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
28 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
29 |
Correct |
1 ms |
212 KB |
Output is correct |
30 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
31 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
32 |
Partially correct |
0 ms |
324 KB |
Failed to provide a successful strategy. |
33 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
34 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
35 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
324 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
352 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
324 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
1 ms |
324 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Correct |
1 ms |
324 KB |
Output is correct |
8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
320 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
21 |
Partially correct |
1 ms |
328 KB |
Failed to provide a successful strategy. |
22 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
23 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
24 |
Partially correct |
1 ms |
328 KB |
Failed to provide a successful strategy. |
25 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
26 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
27 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
28 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
29 |
Correct |
1 ms |
212 KB |
Output is correct |
30 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
31 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
32 |
Partially correct |
0 ms |
324 KB |
Failed to provide a successful strategy. |
33 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
34 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
35 |
Halted |
0 ms |
0 KB |
- |