Submission #572451

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
572451	2022-06-04T11:56:16 Z	valerikk	Newspapers (CEOI21_newspapers)	C++17	4 / 100	2 ms	468 KB

newspapers

#include <bits/stdc++.h>

using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n, m;
	cin >> n >> m;

	for (int i = 0; i < m; ++i) {
		int u, v;
		cin >> u >> v;
	}

	if (m > n - 1) {
		cout << "NO\n";
		return 0;
	}

	cout << "YES\n";

	if (n == 1) {
		cout << "1\n1\n";
		return 0;
	}

	if (n == 2) {
		cout << "2\n1 1\n";
		return 0;
	}

	cout << 2 * n - 4 << "\n";
	cout << 2 << " " << 2 << " ";
	for (int i = 3; i <= n - 1; ++i) {
		cout << i << " " << i - 2 << "\n";
	}
	cout << "\n";
	return 0;
}

Subtask #1

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
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	1 ms	320 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	-

Subtask #2

4.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Partially correct	1 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	1 ms	320 KB	Failed to provide a successful strategy.
7	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
8	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
9	Partially correct	2 ms	256 KB	Failed to provide a successful strategy.
10	Partially correct	1 ms	212 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	212 KB	Failed to provide a successful strategy.
13	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
14	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
15	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
16	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
17	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
18	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
19	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
20	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.

Subtask #3

0.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
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	1 ms	320 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	-