1a:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1d:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T4a0,#include using namespace std; int main() { int n; cin >> n; vector> adj(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } vector parent(n + 1, -1), order; parent[1] = 0; queue q; q.push(1); while (!q.empty()) { int u = q.front(); q.pop(); order.push_back(u); for (int v : adj[u]) if (parent[v] == -1) { parent[v] = u; q.push(v); } } vector size(n + 1, 1); for (int i = (int)order.size() - 1; i >= 0; i--) { int u = order[i]; if (parent[u] != 0) size[parent[u]] += size[u]; } vector maxComp(n + 1, 0); for (int u = 1; u <= n; u++) { long long best = n - size[u]; for (int v : adj[u]) if (v != parent[u]) best = max(best, size[v]); maxComp[u] = best; } vector centroids; for (int u = 1; u <= n; u++) if (maxComp[u] <= n / 2) centroids.push_back(u); sort(centroids.begin(), centroids.end()); for (size_t i = 0; i < centroids.size(); i++) cout << centroids[i] << (i + 1 < centroids.size() ? " " : "\n"); return 0; } 1c:T4a0,#include using namespace std; int main() { int n; cin >> n; vector> adj(n + 1); for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } vector parent(n + 1, -1), order; parent[1] = 0; queue q; q.push(1); while (!q.empty()) { int u = q.front(); q.pop(); order.push_back(u); for (int v : adj[u]) if (parent[v] == -1) { parent[v] = u; q.push(v); } } vector size(n + 1, 1); for (int i = (int)order.size() - 1; i >= 0; i--) { int u = order[i]; if (parent[u] != 0) size[parent[u]] += size[u]; } vector maxComp(n + 1, 0); for (int u = 1; u <= n; u++) { long long best = n - size[u]; for (int v : adj[u]) if (v != parent[u]) best = max(best, size[v]); maxComp[u] = best; } vector centroids; for (int u = 1; u <= n; u++) if (maxComp[u] <= n / 2) centroids.push_back(u); sort(centroids.begin(), centroids.end()); for (size_t i = 0; i < centroids.size(); i++) cout << centroids[i] << (i + 1 < centroids.size() ? " " : "\n"); return 0; }