Submission #769201

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
769201	2023-06-29T09:50:36 Z	RushB	Newspapers (CEOI21_newspapers)	C++17	52 / 100	25 ms	588 KB

newspapers

#include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long INF = 1ll << 60;
const int N = 1000 + 5;
vector<int> adj[N], V[N], order;
bitset<N> leaf;
 
void dfs(int v, int p) {
	V[v] = {0};
	for (auto u: adj[v]) if (u != p) {
		dfs(u, v);
		V[v].push_back(V[u][0] + 1);
	}
	sort(V[v].rbegin(), V[v].rend());
}

void dfs2(int v, int p) {
	order.push_back(v);
	for (auto u: adj[v]) if (u != p && adj[u].size() == 1) {
		order.push_back(u);
		order.push_back(v);
	}
	for (auto u: adj[v]) if (u != p && adj[u].size() > 1)
		dfs2(u, v);
}
 
signed main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int n, m;
	cin >> n >> m;
	if (m >= n) {
		cout << "NO\n";
		return 0;
	}
	if (n <= 2) {
		cout << "YES\n";
		cout << n << '\n';
		FOR(i, 0, n) cout << 1 << ' ';
		return 0;
	}
	FOR(i, 1, n) {
		int u, v; cin >> u >> v;	
		u--, v--;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	FOR(i, 0, n) leaf[i] = adj[i].size() == 1;
	FOR(i, 0, n) if (!leaf[i]) {
		vector<int> t;
		for (auto u: adj[i]) if (!leaf[u]) t.push_back(u);
		adj[i] = t;
	}
	//is caterpillar?
	FOR(i, 0, n) {
		FOR(j, 0, n) V[j].clear();
		dfs(i, i);
		if (V[i].size() >= 3 && V[i][2] >= 2) {
			cout << "NO\n";
			return 0;
		}
	}
	int rt = -1;
	FOR(i, 0, n) if (!leaf[i] && adj[i].size() <= 1) rt = i;

	cout << "YES\n";
	dfs2(rt, rt);
	cout << order.size() * 2 << '\n';
	for (auto u: order) cout << u + 1 << ' ';
	reverse(order.begin(), order.end());
	for (auto u: order) cout << u + 1 << ' ';
	cout << '\n';
	return 0;
}
//Reading this fills you with ....

Subtask #1
6.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	368 KB	Output is correct
3	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
4	Partially correct	1 ms	364 KB	Provide a successful but not optimal strategy.
5	Correct	1 ms	340 KB	Output is correct
6	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
7	Correct	1 ms	340 KB	Output is correct
8	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
9	Correct	1 ms	340 KB	Output is correct
10	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
12	Partially correct	1 ms	352 KB	Provide a successful but not optimal strategy.
13	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
14	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
15	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
16	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
17	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
18	Partially correct	1 ms	368 KB	Provide a successful but not optimal strategy.
19	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
20	Partially correct	1 ms	372 KB	Provide a successful but not optimal strategy.
21	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
22	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
23	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
24	Partially correct	0 ms	368 KB	Provide a successful but not optimal strategy.
25	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
26	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
27	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
28	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
29	Correct	1 ms	340 KB	Output is correct
30	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
31	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
32	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
33	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
34	Correct	0 ms	340 KB	Output is correct
35	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
36	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
37	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
38	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
39	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
40	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
41	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
42	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
43	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
44	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	0 ms	340 KB	Output is correct
48	Partially correct	1 ms	264 KB	Provide a successful but not optimal strategy.
49	Correct	0 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
52	Correct	1 ms	340 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
55	Correct	0 ms	340 KB	Output is correct
56	Correct	0 ms	364 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	364 KB	Output is correct
62	Correct	1 ms	340 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	368 KB	Output is correct

Subtask #2
6.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	Partially correct	1 ms	368 KB	Provide a successful but not optimal strategy.
5	Partially correct	0 ms	364 KB	Provide a successful but not optimal strategy.
6	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
7	Partially correct	0 ms	368 KB	Provide a successful but not optimal strategy.
8	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
9	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
10	Partially correct	1 ms	364 KB	Provide a successful but not optimal strategy.
11	Partially correct	17 ms	468 KB	Provide a successful but not optimal strategy.
12	Partially correct	6 ms	368 KB	Provide a successful but not optimal strategy.
13	Partially correct	8 ms	468 KB	Provide a successful but not optimal strategy.
14	Partially correct	9 ms	504 KB	Provide a successful but not optimal strategy.
15	Partially correct	10 ms	516 KB	Provide a successful but not optimal strategy.
16	Partially correct	19 ms	500 KB	Provide a successful but not optimal strategy.
17	Partially correct	19 ms	500 KB	Provide a successful but not optimal strategy.
18	Partially correct	20 ms	468 KB	Provide a successful but not optimal strategy.
19	Partially correct	20 ms	576 KB	Provide a successful but not optimal strategy.
20	Partially correct	20 ms	568 KB	Provide a successful but not optimal strategy.

Subtask #3
40.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	368 KB	Output is correct
3	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
4	Partially correct	1 ms	364 KB	Provide a successful but not optimal strategy.
5	Correct	1 ms	340 KB	Output is correct
6	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
7	Correct	1 ms	340 KB	Output is correct
8	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
9	Correct	1 ms	340 KB	Output is correct
10	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
12	Partially correct	1 ms	352 KB	Provide a successful but not optimal strategy.
13	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
14	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
15	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
16	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
17	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
18	Partially correct	1 ms	368 KB	Provide a successful but not optimal strategy.
19	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
20	Partially correct	1 ms	372 KB	Provide a successful but not optimal strategy.
21	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
22	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
23	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
24	Partially correct	0 ms	368 KB	Provide a successful but not optimal strategy.
25	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
26	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
27	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
28	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
29	Correct	1 ms	340 KB	Output is correct
30	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
31	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
32	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
33	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
34	Correct	0 ms	340 KB	Output is correct
35	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
36	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
37	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
38	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
39	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
40	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
41	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
42	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
43	Partially correct	0 ms	340 KB	Failed to provide a successful strategy.
44	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	0 ms	340 KB	Output is correct
48	Partially correct	1 ms	264 KB	Provide a successful but not optimal strategy.
49	Correct	0 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
52	Correct	1 ms	340 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
55	Correct	0 ms	340 KB	Output is correct
56	Correct	0 ms	364 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	364 KB	Output is correct
62	Correct	1 ms	340 KB	Output is correct
63	Correct	1 ms	340 KB	Output is correct
64	Correct	1 ms	368 KB	Output is correct
65	Correct	1 ms	340 KB	Output is correct
66	Correct	1 ms	340 KB	Output is correct
67	Partially correct	0 ms	364 KB	Provide a successful but not optimal strategy.
68	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
69	Correct	1 ms	340 KB	Output is correct
70	Partially correct	0 ms	340 KB	Provide a successful but not optimal strategy.
71	Correct	1 ms	340 KB	Output is correct
72	Partially correct	1 ms	364 KB	Provide a successful but not optimal strategy.
73	Correct	0 ms	340 KB	Output is correct
74	Partially correct	1 ms	364 KB	Failed to provide a successful strategy.
75	Partially correct	1 ms	360 KB	Provide a successful but not optimal strategy.
76	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
77	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
78	Partially correct	1 ms	360 KB	Provide a successful but not optimal strategy.
79	Correct	1 ms	340 KB	Output is correct
80	Correct	1 ms	340 KB	Output is correct
81	Correct	1 ms	372 KB	Output is correct
82	Correct	1 ms	340 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	1 ms	372 KB	Output is correct
85	Correct	1 ms	340 KB	Output is correct
86	Correct	1 ms	340 KB	Output is correct
87	Correct	1 ms	372 KB	Output is correct
88	Correct	1 ms	340 KB	Output is correct
89	Partially correct	16 ms	484 KB	Failed to provide a successful strategy.
90	Partially correct	13 ms	484 KB	Provide a successful but not optimal strategy.
91	Partially correct	12 ms	484 KB	Failed to provide a successful strategy.
92	Partially correct	15 ms	476 KB	Failed to provide a successful strategy.
93	Partially correct	16 ms	496 KB	Provide a successful but not optimal strategy.
94	Partially correct	11 ms	368 KB	Failed to provide a successful strategy.
95	Partially correct	18 ms	504 KB	Failed to provide a successful strategy.
96	Partially correct	17 ms	468 KB	Failed to provide a successful strategy.
97	Partially correct	10 ms	368 KB	Failed to provide a successful strategy.
98	Partially correct	25 ms	492 KB	Provide a successful but not optimal strategy.
99	Partially correct	13 ms	488 KB	Failed to provide a successful strategy.
100	Partially correct	14 ms	472 KB	Failed to provide a successful strategy.
101	Partially correct	12 ms	472 KB	Failed to provide a successful strategy.
102	Partially correct	13 ms	476 KB	Provide a successful but not optimal strategy.
103	Partially correct	14 ms	468 KB	Failed to provide a successful strategy.
104	Partially correct	12 ms	464 KB	Failed to provide a successful strategy.
105	Partially correct	11 ms	500 KB	Failed to provide a successful strategy.
106	Partially correct	15 ms	500 KB	Provide a successful but not optimal strategy.
107	Partially correct	11 ms	480 KB	Provide a successful but not optimal strategy.
108	Partially correct	17 ms	468 KB	Provide a successful but not optimal strategy.
109	Partially correct	13 ms	468 KB	Failed to provide a successful strategy.
110	Partially correct	14 ms	480 KB	Provide a successful but not optimal strategy.
111	Partially correct	11 ms	472 KB	Failed to provide a successful strategy.
112	Partially correct	17 ms	500 KB	Provide a successful but not optimal strategy.
113	Partially correct	17 ms	468 KB	Failed to provide a successful strategy.
114	Partially correct	14 ms	500 KB	Provide a successful but not optimal strategy.
115	Partially correct	12 ms	468 KB	Failed to provide a successful strategy.
116	Partially correct	14 ms	480 KB	Failed to provide a successful strategy.
117	Partially correct	25 ms	500 KB	Failed to provide a successful strategy.
118	Partially correct	15 ms	468 KB	Failed to provide a successful strategy.
119	Partially correct	13 ms	476 KB	Failed to provide a successful strategy.
120	Partially correct	15 ms	504 KB	Failed to provide a successful strategy.
121	Partially correct	15 ms	468 KB	Provide a successful but not optimal strategy.
122	Partially correct	12 ms	468 KB	Provide a successful but not optimal strategy.
123	Partially correct	11 ms	368 KB	Provide a successful but not optimal strategy.
124	Partially correct	16 ms	492 KB	Failed to provide a successful strategy.
125	Partially correct	10 ms	472 KB	Provide a successful but not optimal strategy.
126	Partially correct	11 ms	472 KB	Failed to provide a successful strategy.
127	Partially correct	14 ms	476 KB	Failed to provide a successful strategy.
128	Partially correct	22 ms	588 KB	Failed to provide a successful strategy.
129	Correct	1 ms	340 KB	Output is correct
130	Correct	1 ms	340 KB	Output is correct
131	Correct	1 ms	376 KB	Output is correct
132	Correct	1 ms	340 KB	Output is correct
133	Correct	1 ms	372 KB	Output is correct
134	Correct	1 ms	340 KB	Output is correct
135	Correct	1 ms	340 KB	Output is correct
136	Correct	0 ms	340 KB	Output is correct
137	Correct	0 ms	376 KB	Output is correct
138	Correct	1 ms	340 KB	Output is correct
139	Correct	1 ms	340 KB	Output is correct
140	Correct	1 ms	376 KB	Output is correct
141	Correct	0 ms	340 KB	Output is correct
142	Correct	0 ms	372 KB	Output is correct
143	Correct	0 ms	340 KB	Output is correct
144	Partially correct	20 ms	560 KB	Provide a successful but not optimal strategy.
145	Partially correct	19 ms	500 KB	Provide a successful but not optimal strategy.

Submission #769201

Compilation message

Subtask #1 6.0 / 12.0

Subtask #2 6.0 / 8.0

Subtask #3 40.0 / 80.0

Subtask #1
6.0 / 12.0

Subtask #2
6.0 / 8.0

Subtask #3
40.0 / 80.0