#include <bits/stdc++.h>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> A(M), B(M);
std::vector<int> deg(N);
for (int i = 0; i < M; ++i) {
std::cin >> A[i] >> B[i];
--A[i], --B[i];
++deg[A[i]];
++deg[B[i]];
}
std::cout << "YES" << std::endl;
std::vector<int> answer;
for (int i = 1; i <= N; ++i) {
answer.push_back(i);
}
if (N != N / 2 * 2) {
answer.push_back(N);
}
for (int i = N / 2 * 2; i >= 1; --i) {
answer.push_back(i);
}
std::cout << answer.size() << std::endl;
for (auto &e : answer) {
std::cout << e << ' ';
}
std::cout << std::endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
2 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
3 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
5 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
2 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
3 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
5 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
7 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
8 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
9 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
10 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
11 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
12 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
13 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
14 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
15 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
16 |
Partially correct |
1 ms |
332 KB |
Provide a successful but not optimal strategy. |
17 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
18 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
19 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
20 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
2 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
3 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
5 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |