#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, m;
cin >> n >> m;
const int maxn = 1000;
vector<int> adjlist[maxn];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--, b--;
adjlist[a].push_back(b), adjlist[b].push_back(a);
}
if (m == n - 1)
cout << "YES\n1\n1\n";
else
cout << "NO\n";
return 0;
if (n == 1) {
cout << "YES\n1\n1\n";
} else if (n == 2) {
cout << "YES\n2\n1 1\n";
} else if (n == 3) {
cout << "YES\n2\n2 2\n";
} else {
cout << "NO\n";
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
408 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
1 ms |
344 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
600 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
408 KB |
Output is correct |
| 8 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
