#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)3e5+10;
int n, m;
int32_t main() {
cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
}
if(n<=m){
cout << "NO\n";
return 0;
}
cout << "YES\n";
if(n==1){
cout << "1\n1"; return 0;
}
if(n==2){
cout << "2\n1 1"; return 0;
}
cout << 2*(n-2) << "\n";
for(int i = 2; i <= n-1; i++) cout << i << " ";
for(int i = n-1; i >= 2; i--) cout << i << " ";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
596 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 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 |
344 KB |
Output is correct |
| 16 |
Correct |
1 ms |
344 KB |
Output is correct |
| 17 |
Correct |
1 ms |
344 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
596 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
