#include<bits/stdc++.h>
#define N 1010
using namespace std;
vector <int> g[N];
int n, m;
bool check(){
int aux = 0;
for(int i= 1;i <= n;i++){
if(g[i].size() > 2) aux++;
}
if(aux > 1) return true;
return false;
}
int main(){
cin >> n >> m;
for(int i = 0;i < m;i++){
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
if(m != n-1){
cout << "NO\n";
return 0;
}
else if(check()){
cout << "NO\n";
return 0;
}
cout << "YES\n";
cout << 1 << endl;
cout << 1 << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |