{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eMatei are un arbore orientat cu $$$n$$$ noduri.\u003c/p\u003e\n\n\u003cp\u003eUn nod $$$u$$$ se numește capitală dacă se poate ajunge de la $$$u$$$ la toate celelalte noduri.\u003c/p\u003e\n\n\u003cp\u003eCostul unui nod $$$u$$$ este egal cu numărul minim de muchii care trebuie inversate astfel încât $$$u$$$ să devină o capitală.\u003c/p\u003e\n\n\n\u003cp\u003eMatei vrea să afle toate nodurile cu cost minim, precum și acest cost minim.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003ePrima linie conține numărul de noduri din arbore $$$n$$$ ($$$1 \\le n \\le 2 \\cdot 10^5$$$). \u003c/p\u003e\n\n\u003cp\u003e Pe fiecare dintre următoarele $$$n-1$$$ linii se află câte două numere $$$u_i$$$ și $$$v_i$$$ ($$$1 \\le u_i, v_i \\le n$$$, $$$u_i \\neq v_i$$$), cu semnificația că există o muchie orientată de la nodul $$$u_i$$$ la nodul $$$v_i$$$\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003ePe prima linie se va afla un număr, costul minim al oricărui nod.\u003c/p\u003e\n\n\u003cp\u003ePe a doua linie se vor afla nodurile cu cost minim, în ordine crescătoare.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n2 1\n2 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\n2 \n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4\n1 4\n2 4\n3 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1 2 3 \n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eÎn primul exemplu, $$$2$$$ deja este o capitală. \u003c/p\u003e\n\n\u003cp\u003eÎn al doilea exemplu, $$$1$$$ poate deveni o capitală dacă se schimbă direcția muchiilor $$$(2 \\rightarrow 4)$$$ și $$$(3 \\rightarrow 4)$$$. Similar, nodurile $$$2$$$ și $$$3$$$ pot deveni capitale schimbând direcțiile a două muchii.\u003c/p\u003e"}}]}