#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
vector<vector<int>> g(N);
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
if (n - 1 == m) {
if (n == 1) {
cout << "YES\n1\n1";
return 0;
}
cout << "YES\n" << n - (n % 2) << '\n';
for (int i = 1 + (n % 2); i <= n; i += 2)
cout << i << ' ' << i << ' ';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
332 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
0 ms |
332 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
0 ms |
204 KB |
Unexpected end of file - token expected |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Partially correct |
0 ms |
332 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
0 ms |
332 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
332 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 |
332 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
332 KB |
Failed to provide a successful strategy. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
204 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
332 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
0 ms |
332 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
0 ms |
204 KB |
Unexpected end of file - token expected |
8 |
Halted |
0 ms |
0 KB |
- |