답안 #590963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590963	2022-07-06T16:02:45 Z	cheissmart	Newspapers (CEOI21_newspapers)	C++14	100 / 100	1 ms	468 KB

newspapers

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, N = 1003;

vi G[N];
int d[N], p[N];
bool onpath[N];

void dfs(int u, int pa = -1, int depth = 0) {
	d[u] = depth, p[u] = pa;
	for(int v:G[u]) if(v != pa)
		dfs(v, u, depth + 1);
}

int mx_depth(int u, int pa) {
	int mx = 0;
	for(int v:G[u]) if(v != pa)
		mx = max(mx, mx_depth(v, u) + 1);
	return mx;
}

signed main()
{
	IO_OP;

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

	if(m != n - 1) {
		cout << "NO" << '\n';
		return 0;
	}
	if(n == 1) {
		cout << "YES\n" << 1 << "\n" << 1 << '\n';
		return 0;
	}
	if(n == 2) {
		cout << "YES\n" << 2 << '\n' << "1 1\n";
		return 0;
	}

	for(int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		G[u].PB(v);
		G[v].PB(u);
	}

	dfs(1);
	int s = max_element(d + 1, d + n + 1) - d;
	dfs(s);
	int t = max_element(d + 1, d + n + 1) - d;

	vi path;
	while(SZ(path) == 0 || path.back() != s) {
		path.PB(t);
		onpath[t] = true;
		t = p[t];
	}
	assert(SZ(path) >= 3);
	vi ans;

	for(int i = 1; i < SZ(path) - 1; i++) {
		int u = path[i];
		ans.PB(u);
		for(int v:G[u]) if(!onpath[v]) {
			int tt = mx_depth(v, u);
			if(tt > 1) {
				cout << "NO\n";
				return 0;
			}
			if(tt == 1)
				ans.PB(v), ans.PB(u);
		}
	}
	for(int i = SZ(ans) - 1; i >= 0; i--)
		ans.PB(ans[i]);

	cout << "YES\n";
	cout << SZ(ans) << '\n';
	for(int u:ans) cout << u << " ";
	cout << '\n';

}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	1 ms	356 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	0 ms	352 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	0 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	0 ms	340 KB	Output is correct
54	Correct	1 ms	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	0 ms	340 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	1 ms	340 KB	Output is correct
61	Correct	0 ms	340 KB	Output is correct
62	Correct	0 ms	356 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	352 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 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	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	352 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct

Subtask #3
80.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	352 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	1 ms	356 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	0 ms	352 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	0 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	0 ms	340 KB	Output is correct
54	Correct	1 ms	340 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	0 ms	340 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	1 ms	340 KB	Output is correct
61	Correct	0 ms	340 KB	Output is correct
62	Correct	0 ms	356 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct
65	Correct	1 ms	340 KB	Output is correct
66	Correct	1 ms	340 KB	Output is correct
67	Correct	0 ms	340 KB	Output is correct
68	Correct	0 ms	340 KB	Output is correct
69	Correct	1 ms	340 KB	Output is correct
70	Correct	1 ms	340 KB	Output is correct
71	Correct	1 ms	340 KB	Output is correct
72	Correct	1 ms	340 KB	Output is correct
73	Correct	1 ms	340 KB	Output is correct
74	Correct	1 ms	340 KB	Output is correct
75	Correct	0 ms	340 KB	Output is correct
76	Correct	1 ms	340 KB	Output is correct
77	Correct	1 ms	340 KB	Output is correct
78	Correct	0 ms	340 KB	Output is correct
79	Correct	1 ms	340 KB	Output is correct
80	Correct	1 ms	340 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	1 ms	348 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	1 ms	340 KB	Output is correct
85	Correct	1 ms	340 KB	Output is correct
86	Correct	1 ms	352 KB	Output is correct
87	Correct	1 ms	340 KB	Output is correct
88	Correct	1 ms	352 KB	Output is correct
89	Correct	1 ms	340 KB	Output is correct
90	Correct	1 ms	340 KB	Output is correct
91	Correct	1 ms	340 KB	Output is correct
92	Correct	1 ms	340 KB	Output is correct
93	Correct	1 ms	340 KB	Output is correct
94	Correct	1 ms	340 KB	Output is correct
95	Correct	1 ms	340 KB	Output is correct
96	Correct	1 ms	340 KB	Output is correct
97	Correct	1 ms	352 KB	Output is correct
98	Correct	1 ms	340 KB	Output is correct
99	Correct	1 ms	340 KB	Output is correct
100	Correct	1 ms	340 KB	Output is correct
101	Correct	1 ms	340 KB	Output is correct
102	Correct	1 ms	352 KB	Output is correct
103	Correct	1 ms	340 KB	Output is correct
104	Correct	1 ms	340 KB	Output is correct
105	Correct	1 ms	356 KB	Output is correct
106	Correct	1 ms	340 KB	Output is correct
107	Correct	1 ms	340 KB	Output is correct
108	Correct	1 ms	340 KB	Output is correct
109	Correct	1 ms	348 KB	Output is correct
110	Correct	1 ms	340 KB	Output is correct
111	Correct	1 ms	340 KB	Output is correct
112	Correct	1 ms	468 KB	Output is correct
113	Correct	1 ms	340 KB	Output is correct
114	Correct	1 ms	352 KB	Output is correct
115	Correct	1 ms	340 KB	Output is correct
116	Correct	1 ms	340 KB	Output is correct
117	Correct	1 ms	340 KB	Output is correct
118	Correct	1 ms	340 KB	Output is correct
119	Correct	1 ms	340 KB	Output is correct
120	Correct	1 ms	340 KB	Output is correct
121	Correct	1 ms	340 KB	Output is correct
122	Correct	1 ms	348 KB	Output is correct
123	Correct	1 ms	340 KB	Output is correct
124	Correct	1 ms	340 KB	Output is correct
125	Correct	1 ms	352 KB	Output is correct
126	Correct	1 ms	352 KB	Output is correct
127	Correct	1 ms	340 KB	Output is correct
128	Correct	1 ms	340 KB	Output is correct
129	Correct	1 ms	340 KB	Output is correct
130	Correct	1 ms	348 KB	Output is correct
131	Correct	1 ms	344 KB	Output is correct
132	Correct	1 ms	340 KB	Output is correct
133	Correct	1 ms	340 KB	Output is correct
134	Correct	1 ms	360 KB	Output is correct
135	Correct	0 ms	340 KB	Output is correct
136	Correct	0 ms	340 KB	Output is correct
137	Correct	1 ms	340 KB	Output is correct
138	Correct	1 ms	340 KB	Output is correct
139	Correct	0 ms	356 KB	Output is correct
140	Correct	1 ms	340 KB	Output is correct
141	Correct	1 ms	340 KB	Output is correct
142	Correct	1 ms	340 KB	Output is correct
143	Correct	1 ms	340 KB	Output is correct
144	Correct	1 ms	340 KB	Output is correct
145	Correct	1 ms	340 KB	Output is correct

답안 #590963

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 8.0 / 8.0

Subtask #3 80.0 / 80.0

Subtask #1
12.0 / 12.0

Subtask #2
8.0 / 8.0

Subtask #3
80.0 / 80.0