#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
--u; --v;
g[u].push_back(v);
g[v].push_back(u);
}
vector<bool> was(n);
function<void(int, int)> Dfs = [&](int v, int pv) {
was[v] = true;
for (int u : g[v]) {
if (u == pv) {
continue;
}
if (was[u]) {
cout << "NO" << '\n';
exit(0);
}
Dfs(u, v);
}
};
for (int i = 0; i < n; i++) {
if (!was[i]) {
Dfs(i, i);
}
}
cout << "YES" << '\n';
if (n == 1) {
cout << 1 << '\n' << 1 << '\n';
}
if (n == 2) {
cout << 2 << '\n' << 2 << " " << 2 << '\n';
}
if (n >= 3) {
cout << 2 * (n - 2) << '\n';
for (int i = 2; i < n; i++) {
cout << i << " " << i << " ";
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 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 |
352 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 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 |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
1 ms |
600 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
1 ms |
600 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 |
344 KB |
Failed to provide a successful strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 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 |
352 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
