trees - 题库 - bzoj.org

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	693	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
	687	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	683	P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	682	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	653	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	638	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	628	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	618	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	617	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	610	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
	597	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	571	P1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	6
	570	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	542	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	539	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	538	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	529	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	9
	528	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	524	P1710D Recover the Tree constructive algorithms trees *3400	0 / 0	10
	514	P1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	10
	502	P1714F Build a Tree and That Is It constructive algorithms implementation trees *1900	0 / 0	6
	501	P1714G Path Prefixes binary search data structures dfs and similar trees *1700	0 / 0	5
	478	P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	469	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	468	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	462	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	449	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	445	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10
	444	P1725J Journey dp trees *2500	0 / 0	9
	437	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	365	P1738D Permutation Addicts constructive algorithms data structures dfs and similar dsu graphs trees *1900	0 / 0	6
	363	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
	357	P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees *1900	0 / 0	6
	350	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	347	P1740H MEX Tree Manipulation data structures trees *3300	0 / 0	10
	342	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
	314	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	300	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	293	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	251	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	9
	248	P1761G Centroid Guess interactive probabilities trees *3500	0 / 0	10
	243	P1762E Tree Sum combinatorics math trees *2600	0 / 0	10
	235	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	229	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	200	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	199	P1767F Two Subtrees data structures trees *3100	0 / 0	10
	188	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	181	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	179	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	177	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	162	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	159	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	138	P1776M Parmigiana With Seafood binary search dp greedy trees *3000	0 / 0	10
	133	P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees *1900	0 / 0	6
	132	P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	131	P1777F Comfortably Numb bitmasks data structures divide and conquer strings trees *2400	0 / 0	9
	126	P1778E The Tree Has Fallen! bitmasks dfs and similar math trees *2500	0 / 0	9
	125	P1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 3	10
	119	P1779F Xorcerer's Stones bitmasks constructive algorithms dp trees *2500	0 / 0	9
	105	P1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	10
	104	P1781G Diverse Coloring constructive algorithms trees *3200	0 / 0	10
	95	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	79	P1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	10
	71	P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	9
	59	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	32	P1794E Labeling the Tree with Distances data structures dp hashing implementation trees	0 / 0	(无)
	26	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	20	P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	1	P1800G Symmetree dfs and similar hashing trees	0 / 0	(无)
	3776	P1801E Gasoline prices data structures divide and conquer dsu hashing trees	0 / 0	(无)
	7795	P1805D A Wide, Wide Graph dfs and similar dp greedy trees	0 / 0	(无)
	7794	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers	0 / 0	(无)
	6343	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	7772	P1810F M-tree data structures math sortings trees *2800	0 / 0	10
	8542	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7
	8583	P1819C The Fox and the Complete Tree Traversal constructive algorithms dp implementation math trees *2400	0 / 0	9
	8581	P1819E Roads in E City interactive math probabilities trees *3200	0 / 0	10
	8566	P1822F Gardening Friends brute force dfs and similar dp graphs trees *1700	0 / 0	5
	8558	P1823F Random Walk dp graphs math probabilities trees *2600	0 / 0	10
	8651	P1824B1 LuoTianyi and the Floating Islands (Easy Version) combinatorics math probabilities trees *1800	0 / 0	6
	8650	P1824B2 LuoTianyi and the Floating Islands (Hard Version) combinatorics dfs and similar math probabilities trees *2300	0 / 0	8
	8649	P1824C LuoTianyi and XOR-Tree data structures dfs and similar dp dsu greedy trees *2500	0 / 0	9
	8647	P1824E LuoTianyi and Cartridge data structures trees *3500	0 / 0	10
	8637	P1827B1 Range Sorting (Easy Version) binary search dp dsu greedy trees two pointers *2000	0 / 0	7
	8634	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	10
	8633	P1827E Bus Routes binary search constructive algorithms dfs and similar greedy trees *3400	0 / 0	10
	8621	P1830A Copil Copac Draws Trees dfs and similar dp graphs trees	0 / 0	(无)
	8618	P1830D Mex Tree brute force dp trees	0 / 0	(无)
	8600	P1833G Ksyusha and Chinchilla constructive algorithms dfs and similar dp dsu greedy implementation trees *1800	0 / 0	6
	8595	P1837E Playoff Fixing combinatorics trees	0 / 0	(无)
	8708	P1842F Tenzing and Tree dfs and similar greedy shortest paths sortings trees *2500	0 / 0	9
	8657	P1843C Sum in Binary Tree bitmasks math trees	0 / 0	(无)
	8656	P1843D Apple Tree combinatorics dfs and similar dp trees	0 / 0	(无)
	8654	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp greedy math trees	0 / 0	(无)
	8653	P1843F2 Omsk Metro (hard version) data structures dfs and similar dp math trees	0 / 0	(无)
	8735	P1844G Tree Weights bitmasks constructive algorithms data structures dfs and similar implementation math matrices number theory trees	0 / 1	10
	8717	P1847C Vampiric Powers, anyone? bitmasks brute force data structures dp greedy trees	0 / 0	(无)
	8769	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy sortings trees	0 / 0	(无)
	8763	P1851F Lisa and the Martians bitmasks data structures greedy sortings strings trees	0 / 0	(无)
	8762	P1851G Vlad and the Mountains data structures dsu graphs implementation sortings trees two pointers	0 / 0	(无)

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