답안 #918953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
918953	2024-01-30T22:12:35 Z	NK_	Newspapers (CEOI21_newspapers)	C++17	8 / 100	1 ms	600 KB

newspapers

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back
#define sz(x) int(x.size())

template<class T> using V = vector<T>;
using vi = V<int>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, M; cin >> N >> M;

	V<vi> adj(N); vi in(N), path(N, 1);
	for(int i = 0; i < M; i++) {
		int u, v; cin >> u >> v; --u, --v;
		adj[u].pb(v);
		adj[v].pb(u);
		in[u]++, in[v]++;
	}

	if (M != N - 1) {
		cout << "NO" << nl;
		exit(0-0);
	}

	if (N == 1) {
		cout << "YES" << nl;
		cout << 1 << nl;
		cout << 1 << nl;
		exit(0-0);
	}

	if (N == 2) {
		cout << "YES" << nl;
		cout << 2 << nl;
		cout << 1 << " " << 1 << nl;
		exit(0-0);
	}

	for(int u = 0; u < N; u++) if (in[u] == 1) path[u] = 0;

	for(int u = 0; u < N; u++) if (!path[u]) {
		for(auto& v : adj[u]) in[v]--;
	}

	// for(int u = 0; u < N; u++) {
	// 	cout << u << " => " << path[u] << " " << in[u] << endl;
	// }

	vi ans;
	function<void(int)> dfs = [&](int u) {
		ans.pb(u); path[u] = 0;

		int chd = 0;
		for(auto& v : adj[u]) if (path[v]) {
			dfs(v); chd++;
		}

		if (chd >= 2) {
			cout << "NO" << nl;
			// assert(false);
			exit(0-0);
		}

		ans.pb(u);
	};

	for(int u = 0; u < N; u++) if (path[u] && in[u] <= 1) dfs(u);

	cout << "YES" << nl;
	cout << sz(ans) << nl;
	for(auto& x : ans) cout << x + 1 << " ";
	cout << nl;

	exit(0-0);
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Incorrect	1 ms	344 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	600 KB	Output is correct
17	Correct	1 ms	600 KB	Output is correct
18	Correct	1 ms	600 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #3

0.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Incorrect	1 ms	344 KB	Output isn't correct
9	Halted	0 ms	0 KB	-