#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> adj[1010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
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);
}
cout << "YES\n";
if (N == 1) cout << "1\n1\n";
else if (N == 2) cout << "2\n1 1\n";
else {
cout << 2*N-4 << "\n";
for (int i = 2; i <= N-1; i++) cout << i << " ";
for (int i = N-1; i >= 2; i++) cout << i << " ";
cout << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Execution timed out |
1087 ms |
146732 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
504 KB |
Output is correct |
3 |
Execution timed out |
1074 ms |
150720 KB |
Time limit exceeded |
4 |
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 |
Execution timed out |
1087 ms |
146732 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |