#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 25;
struct DSU {
int sze[MAXN], par[MAXN];
void init () {
for (int i = 1; i < MAXN; i++) {
sze[i] = 1; par[i] = i;
}
}
int find (int x) {
return par[x] == x ? x : par[x] = find(par[x]);
}
void merge (int a, int b) {
a = find(a); b = find(b);
if (a == b) return;
if (sze[a] > sze[b]) swap(a, b);
sze[b] += sze[a]; par[a] = b;
}
} cur;
int n, m;
int main () {
bool flag = 1;
cin >> n >> m;
cur.init();
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
if (cur.find(a) == cur.find(b)) {
flag = 0;
} else {
cur.merge(a, b);
}
}
cout << (flag ? "YES\n" : "NO\n");
cout << "1\n1\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
Incorrect |
0 ms |
348 KB |
Extra information in the output file |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
344 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 |
440 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
440 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 |
1 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 |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
1 ms |
348 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 |
348 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
Incorrect |
0 ms |
348 KB |
Extra information in the output file |
| 8 |
Halted |
0 ms |
0 KB |
- |
