trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6128	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
	6133	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	(None)
	6164	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(None)
	6179	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	(None)
	6182	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	(None)
	6191	P1610I Mashtali vs AtCoder games trees *3100	0 / 0	(None)
	6194	P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	(None)
	6195	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(None)
	6213	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
	6241	P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	(None)
	6254	P1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	(None)
	6255	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	(None)
	6261	P1627C Not Assigning constructive algorithms dfs and similar number theory trees *1400	0 / 0	(None)
	6266	P1628E Groceries in Meteor Town binary search data structures dsu trees *3100	0 / 0	(None)
	6277	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
	6278	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(None)
	6281	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
	6282	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
	6451	6451 Perfect Security data structures greedy strings trees *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.