#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
}
if (m > n - 1) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
if (n == 1) {
cout << "1\n1\n";
return 0;
}
if (n == 2) {
cout << "2\n1 1\n";
return 0;
}
cout << 2 * n - 4 << "\n";
cout << 2 << " " << 2 << " ";
for (int i = 3; i <= n - 1; ++i) {
cout << i << " " << i - 2 << "\n";
}
cout << "\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
1 ms |
320 KB |
Output is correct |
| 8 |
Partially correct |
1 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 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
320 KB |
Output is correct |
| 4 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
1 ms |
320 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
2 ms |
256 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
1 ms |
320 KB |
Output is correct |
| 8 |
Partially correct |
1 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 |
- |
