trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	476	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(None)
	475	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(None)
	452	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	451	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	427	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	383	P1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	(None)
	379	P1575I Illusions of the Desert data structures trees *2300	0 / 0	(None)
	351	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(None)
	349	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
	335	P1583B Omkar and Heavenly Tree constructive algorithms trees *1200	0 / 0	(None)
	332	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	329	P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	(None)
	317	P1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	(None)
	315	P1585G Poachers dp games graphs trees *2500	0 / 0	(None)
	310	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
	309	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
	300	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	(None)
	292	P1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	(None)
	251	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(None)
	243	P1606F Tree Queries brute force dp trees *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.