제출 #881926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
881926		TAhmed33	Newspapers (CEOI21_newspapers)	C++98	0 / 100	0 ms	348 KiB

newspapers

#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");
	if (!flag) return 0;
	if (n & 1) {
		cout << 2 * (n - 1) << '\n';
		for (int i = 1; i < n; i++) cout << i << " ";
		for (int i = 1; i < n; i++) cout << i << " ";
		cout << '\n';
	} else {
		cout << 2 * (n - 1) << '\n';
		for (int i = 1; i < n; i++) cout << i << " ";
		for (int i = 2; i <= n; i++) cout << i << " ";
		cout << '\n';
	}
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 8
• Subtask 3: 0 / 80