trees - 题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	435	P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
	412	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
	406	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	402	P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	401	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	372	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	357	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	347	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	337	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	336	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	329	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
	316	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	290	P1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	6
	289	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	261	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	258	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	257	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	248	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	9
	247	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	243	P1710D Recover the Tree constructive algorithms trees *3400	0 / 0	10
	233	P1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	10
	221	P1714F Build a Tree and That Is It constructive algorithms implementation trees *1900	0 / 0	6
	220	P1714G Path Prefixes binary search data structures dfs and similar trees *1700	0 / 0	5
	197	P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	188	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	187	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	181	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	168	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	164	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10
	163	P1725J Journey dp trees *2500	0 / 0	9
	156	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	90	P1738D Permutation Addicts constructive algorithms data structures dfs and similar dsu graphs trees *1900	0 / 0	6
	88	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
	82	P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees *1900	0 / 0	6
	75	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	72	P1740H MEX Tree Manipulation data structures trees *3300	0 / 0	10
	67	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
	39	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	25	P1748E Yet Another Array Counting Problem combinatorics data structures divide and conquer dp trees *2300	0 / 0	8
	18	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	8218	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	8310	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	8303	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	8301	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	8299	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8256	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	8253	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	8294	P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees	0 / 0	(无)
	8293	P1777E Edge Reverse binary search dfs and similar graphs trees	0 / 0	(无)
	8292	P1777F Comfortably Numb bitmasks data structures divide and conquer strings trees	0 / 0	(无)
	8332	P1778E The Tree Has Fallen! bitmasks dfs and similar math trees	0 / 0	(无)
	8331	P1778F Maximizing Root dfs and similar dp graphs math trees	0 / 0	(无)
	8239	P1779F Xorcerer's Stones bitmasks constructive algorithms dp trees	0 / 0	(无)
	8280	P1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	10
	8279	P1781G Diverse Coloring constructive algorithms trees *3200	0 / 0	10
	8230	P1783G Weighed Tree Radius data structures divide and conquer implementation trees	0 / 0	(无)
	8324	P1787G Colorful Tree Again brute force data structures trees	0 / 0	(无)
	8360	P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees	0 / 0	(无)
	8316	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees	0 / 0	(无)
	8403	P1794E Labeling the Tree with Distances data structures dp hashing trees	0 / 0	(无)
	8367	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	8398	P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	8379	P1800G Symmetree dfs and similar hashing trees	0 / 0	(无)
	8435	P1801E Gasoline prices data structures divide and conquer dsu hashing trees *3000	0 / 0	10
	8475	P1805D A Wide, Wide Graph dfs and similar dp greedy trees	0 / 0	(无)
	8474	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers	0 / 0	(无)
	8418	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	8452	P1810F M-tree data structures math sortings trees *2800	0 / 0	10
	9170	P1837E Playoff Fixing combinatorics trees	0 / 0	(无)
	8568	P1842F Tenzing and Tree dfs and similar greedy shortest paths sortings trees *2500	0 / 0	9
	8562	P1843C Sum in Binary Tree bitmasks combinatorics math trees *800	0 / 0	3
	8561	P1843D Apple Tree combinatorics dfs and similar dp math trees *1200	0 / 0	4
	8559	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp graphs greedy math trees *1800	0 / 0	6
	8558	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	8550	P1844G Tree Weights bitmasks constructive algorithms data structures dfs and similar implementation math matrices number theory trees *3000	0 / 0	10
	8517	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees	0 / 0	(无)
	8503	P1851F Lisa and the Martians bitmasks greedy math strings trees	0 / 0	(无)
	8502	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers	0 / 0	(无)
	8489	P1854D Michael and Hotel interactive trees	0 / 0	(无)
	8627	P1856E1 PermuTree (easy version) dfs and similar dp trees *1800	0 / 0	6
	8626	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	8622	P1857D Strong Vertices math sortings trees *1300	0 / 0	4
	8619	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	8614	P1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	9
	8613	P1858E2 Rollbacks (Hard Version) data structures interactive trees *2600	0 / 0	10
	8607	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	8715	P1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	5
	8704	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	8703	P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	8589	P1864E Guess Game bitmasks constructive algorithms data structures games math probabilities sortings strings trees	0 / 0	(无)
	8692	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	8679	P1868C Travel Plan combinatorics dp implementation math trees *2400	0 / 0	9
	8678	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	8666	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8651	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	8733	P1876E Ball-Stackable constructive algorithms data structures dp trees	0 / 0	(无)
	8731	P1876G Clubstep binary search brute force data structures greedy trees	0 / 0	(无)
	8644	P1878G wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees	0 / 0	(无)
	8639	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive math trees *2400	0 / 0	9
	8723	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(无)

根据当前过滤条件随机选择一道题