#include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long INF = 1ll << 60;
const int N = 1000 + 5;
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
if (m >= n) {
cout << "NO\n";
return 0;
}
FOR(i, 1, n) {
int u, v; cin >> u >> v;
}
cout << "YES\n";
cout << 2 * n << '\n';
FOR(i, 0, n) cout << i + 1 << ' ';
FOR(i, 0, n) cout << n - i << ' ';
cout << '\n';
return 0;
}
//Reading this fills you with DETERMINATION
//20:06:46
| # |
결과 |
실행 시간 |
메모리 |
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 |
220 KB |
Provide a successful but not optimal strategy. |
| 6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
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 |
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 |
0 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 |
1 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 |
0 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 |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
| 15 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
| 16 |
Partially correct |
1 ms |
212 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 |
220 KB |
Provide a successful but not optimal strategy. |
| 6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
