trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7959	P1738D Permutation Addicts constructive algorithms dfs and similar dsu graphs trees	0 / 0	(None)
	7957	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths sortings trees	0 / 0	(None)
	7951	P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees	0 / 0	(None)
	8041	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	8038	P1740H MEX Tree Manipulation data structures trees *3300	0 / 0	10
	7986	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees	0 / 0	(None)
	8000	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	8060	P1748E Yet Another Array Counting Problem data structures divide and conquer dp flows math trees *2300	0 / 0	8
	8018	P1749F Distance to the Path data structures dfs and similar trees	0 / 0	(None)
	8065	P1761G Centroid Guess interactive probabilities trees	0 / 0	(None)
	8144	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	8143	P1767F Two Subtrees data structures trees *3100	0 / 0	10
	8132	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees	0 / 0	(None)
	8125	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	8123	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	8121	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8084	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	8081	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	8176	P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees	0 / 0	(None)
	8175	P1777E Edge Reverse binary search dfs and similar graphs implementation sortings trees	0 / 0	(None)

Pick a problem randomly based on the current filter.