답안 #944885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
944885	2024-03-13T07:21:35 Z	Halym2007	Newspapers (CEOI21_newspapers)	C++11	8 / 100	1 ms	600 KB

newspapers

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 1e3 + 5;
//vector <int> v[N];
//bool vis[N];
//void dfs (int x, int pr) {
//	vis[x] = 1;
//	for (int i : v[x]) {
//		if (i == pr) continue;
//		if (vis[i]) {
//			cout << "NO";
//			exit(0);
//		}
//		dfs (i, x);
//	}
//	vis[x] = 2;
//}

int main () {
//	freopen ("input.txt", "r", stdin);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		int l, r;
		cin >> l >> r;
//		v[l].pb (r);
//		v[r].pb (l);
	}
//	dfs (1, -1);
//	if (m == n - 1) cout << "YES\n";
//	else {
//		if (n < 20) cout << "NO\n";
//		else cout << "YES\n";
//	}
//	
	cout << "YES\n";
	if (n <= 2) {
		cout << n << "\n";
		for (int i = 1; i <= n; ++i) {
			cout << n << " ";
		}
		return 0;
	}
	cout << 2*n - 4 << "\n";
	for (int i = 2; i < n; ++i) {
		cout << i << " ";
	}
	for (int i = n - 1; i > 1; i--) {
		cout << i << " ";
	}
//	cout << n * 4 - 4 << "\n";
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
7	Incorrect	0 ms	348 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	600 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 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	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
7	Incorrect	0 ms	348 KB	Output isn't correct
8	Halted	0 ms	0 KB	-