Submission #881924

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
881924	2023-12-02T09:21:01 Z	TAhmed33	Newspapers (CEOI21_newspapers)	C++	4 / 100	1 ms	604 KB

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;
	cout << 2 * n << '\n';
	for (int i = 1; i <= n; i++) cout << i << " ";
	for (int i = 1; i <= n; i++) cout << i << " ";
	cout << '\n';
}

Subtask #1

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
2	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
4	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
7	Correct	1 ms	344 KB	Output is correct
8	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
9	Incorrect	1 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #2

4.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	604 KB	Provide a successful but not optimal strategy.
2	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
4	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
6	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
7	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
8	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
9	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
10	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
12	Partially correct	1 ms	344 KB	Provide a successful but not optimal 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	0 ms	348 KB	Provide a successful but not optimal strategy.
16	Partially correct	1 ms	428 KB	Failed to provide a successful strategy.
17	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
18	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
19	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
20	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.

Subtask #3

0.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
2	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
4	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
7	Correct	1 ms	344 KB	Output is correct
8	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
9	Incorrect	1 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-