{"problem":{"name":"10. Labyrinth-10","description":{"content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":8000,"memory_limit":524288},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF92110"},"statements":[{"statement_type":"Markdown","content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"请在此查看题目描述：http://codeforces.com/contest/921/problem/01.\n\n[samples]","is_translate":true,"language":"Chinese"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the number of vertices in a tree.  \nLet $ T = (V, E) $ be a tree with $ V = \\{1, 2, \\dots, n\\} $ and $ |E| = n - 1 $.  \nLet $ d(v) $ denote the degree of vertex $ v \\in V $.  \n\n**Constraints**  \n1. $ 1 \\le n \\le 2 \\cdot 10^5 $  \n2. The graph $ T $ is a tree (connected, acyclic, undirected).  \n\n**Objective**  \nFind the maximum number of vertices that can be colored such that no two adjacent vertices are both colored, i.e., find the size of the maximum independent set in $ T $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF92110","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}