oj.uz

Submission #881906

# Submission time Handle Problem Language Result Execution time Memory
881906 2023-12-02T08:40:51 Z TAhmed33 Newspapers (CEOI21_newspapers) C++
0 / 100
 0 ms 348 KB 
#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");
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -