#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 25;
int col[MAXN];
vector <int> adj[MAXN];
int n, m;
void dfs (int pos, int c) {
if (col[pos] != -1) {
if (col[pos] != c) {
cout << "NO\n";
exit(0);
}
return;
}
col[pos] = c;
for (auto j : adj[pos]) {
dfs(j, c ^ 1);
}
}
int main () {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
memset(col, -1, sizeof(col));
dfs(1, 0);
cout << "YES\n";
if (n == 1) {
cout << "1\n1\n";
return 0;
}
if (n == 2) {
cout << "2\n2 2\n";
return 0;
}
cout << 2 * (n - 2) << '\n';
for (int i = 2; i < n; i++) cout << i << " ";
for (int i = n - 1; i >= 2; i--) cout << i << " ";
cout << '\n';
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
356 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 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 |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
352 KB |
Output is correct |
| 7 |
Correct |
1 ms |
600 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
600 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
344 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
348 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
356 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 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 |
- |
