#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int p[1005];
int get (int x) {
if (x == p[x]) return x;
return p[x] = get(p[x]);
}
void u (int x, int y) {
x = get(x), y = get(y);
if (x == y) return;
p[x] = y;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
bool ok = 1;
for (int i = 1; i <= n; i++) p[i] = i;
for (int i = 1; i <= m; i++) {
int x, y; cin >> x >> y;
if (get(x) == get(y)) ok = 0;
u(x, y);
}
if (ok) cout << "YES\n" << "1\n1";
else cout << "NO\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 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 |
0 ms |
212 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 |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 8 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
0 ms |
224 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 |
224 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
0 ms |
216 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
224 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
0 ms |
224 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
0 ms |
220 KB |
Failed to provide a successful strategy. |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 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 |
0 ms |
212 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 |
- |
