oj.uz

Submission #717227

# Submission time Handle Problem Language Result Execution time Memory
717227 2023-04-01T15:25:01 Z hollwo_pelw Newspapers (CEOI21_newspapers) C++17
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;

void Hollwo_Pelw();

signed main(){
#ifndef hollwo_pelw_local
	if (fopen(".inp", "r"))
		assert(freopen(".inp", "r", stdin)), assert(freopen(".out", "w", stdout));
#else
	using namespace chrono;
	auto start = steady_clock::now();
#endif
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = steady_clock::now();
	cout << "\nExecution time : " << duration_cast<milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}

const int N = 1005;

int n, m, S, T, hS[N], hT[N], path[N];
vector<int> adj[N], res;

void dfs(int u, int p, int *h) {
	h[u] = p ? h[p] + 1 : 0;
	for (int v : adj[u]) if (v != p)
		dfs(v, u, h);
}

void Hollwo_Pelw(){
	cin >> n >> m;
	if (m >= n) return cout << "NO\n", (void) 0;
	for (int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	if (n == 1) return cout << "YES\n1\n1\n", (void) 0;
	if (n == 2) return cout << "YES\n2\n1 1\n", (void) 0;
	dfs(1, 0, hS);
	S = max_element(hS + 1, hS + n + 1) - hS, dfs(S, 0, hS);
	T = max_element(hS + 1, hS + n + 1) - hS, dfs(T, 0, hT);

	const int LEN = hS[T];

	// cout << LEN << '\n';
	// cout << S << ' ' << T << '\n';

	for (int i = 1; i <= n; i++) {
		if (hS[i] + hT[i] > LEN + 4) // can not reach ?
			return cout << "NO\n", (void) 0;
		if (hS[i] + hT[i] == LEN)
			path[hS[i]] = i;
	}

	// for (int i = 1; i <= n; i++)
	// 	cout << hS[i] + hT[i] << " \n"[i == n];

	for (int i = 1; i <= LEN - 1; i++) {
		int u = path[i];
		res.push_back(u);
		for (int v : adj[u])
			if (hS[v] + hT[v] > LEN && (int) adj[v].size() > 1)
				res.push_back(v), res.push_back(u);
	}

	for (int i = LEN - 1; i >= 1; i--) {
		int u = path[i];
		res.push_back(u);
		for (int v : adj[u])
			if (hS[v] + hT[v] > LEN && (int) adj[v].size() > 1)
				res.push_back(v), res.push_back(u);
	}

	cout << "YES\n";
	cout << res.size() << '\n';
	for (int x : res)
		cout << x << ' ';
	cout << '\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 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 0 ms 340 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 340 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 344 KB Output is correct
40 Correct 1 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 356 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 352 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 356 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 1 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 1 ms 348 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 352 KB Output is correct
64 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 2 ms 352 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 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 360 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 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 0 ms 340 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 340 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 344 KB Output is correct
40 Correct 1 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 356 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 352 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 356 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 1 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 1 ms 348 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 352 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 1 ms 340 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 0 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 352 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 348 KB Output is correct
76 Correct 0 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 1 ms 348 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 340 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 352 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 356 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 1 ms 352 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 356 KB Output is correct
92 Correct 1 ms 352 KB Output is correct
93 Correct 1 ms 372 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 340 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 340 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 344 KB Output is correct
106 Correct 1 ms 348 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 340 KB Output is correct
110 Correct 1 ms 340 KB Output is correct
111 Correct 1 ms 352 KB Output is correct
112 Correct 1 ms 340 KB Output is correct
113 Correct 1 ms 340 KB Output is correct
114 Correct 1 ms 340 KB Output is correct
115 Correct 1 ms 360 KB Output is correct
116 Correct 1 ms 348 KB Output is correct
117 Correct 1 ms 404 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 340 KB Output is correct
123 Correct 1 ms 360 KB Output is correct
124 Correct 1 ms 356 KB Output is correct
125 Correct 1 ms 340 KB Output is correct
126 Correct 1 ms 340 KB Output is correct
127 Correct 1 ms 352 KB Output is correct
128 Correct 1 ms 340 KB Output is correct
129 Correct 1 ms 352 KB Output is correct
130 Correct 1 ms 340 KB Output is correct
131 Correct 1 ms 340 KB Output is correct
132 Correct 1 ms 340 KB Output is correct
133 Correct 1 ms 360 KB Output is correct
134 Correct 1 ms 340 KB Output is correct
135 Correct 1 ms 340 KB Output is correct
136 Correct 1 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 1 ms 340 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 352 KB Output is correct
145 Correct 1 ms 352 KB Output is correct