#include <bits/stdc++.h>
#include <fstream>
//#define endl '\n'
#define mod 1000000007
#define INF 9000000000000000
using namespace std;
const int Max = 1e4;
vector<int> v[Max];
bool ok[Max];
void dfs(int s, int p) {
ok[s] = 1;
for(auto i : v[s]) {
if(i != p) {
if(ok[i] == 1) {
cout << "NO";
exit(0);
}
dfs(i,s);
}
}
}
int main()
{
ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
int n, m; cin >> n >> m;
for(int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
dfs(1,0);
cout << "YES" << endl << '1' << endl << '1' << ' ';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
600 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
604 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
604 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
696 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
696 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 8 |
Partially correct |
0 ms |
700 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
1 ms |
604 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
1 ms |
604 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
1 ms |
604 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
600 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
1 ms |
604 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
1 ms |
604 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
604 KB |
Failed to provide a successful strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
600 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
604 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
604 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
