trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1922	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	(None)
	1921	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(None)
	1911	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	(None)
	1910	P1280D Miss Punyverse dp greedy trees *2500	0 / 0	(None)
	1894	P1283F DIY Garland constructive algorithms greedy trees *2200	0 / 0	(None)
	1888	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	(None)
	1883	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
	1882	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
	1879	P1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	(None)
	1854	P1292C Xenon's Attack on the Gangs combinatorics dfs and similar dp greedy trees *2300	0 / 0	(None)
	1853	P1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	(None)
	1843	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	(None)
	1830	P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	(None)
	1825	P1297E Modernization of Treeland *special problem dfs and similar trees	0 / 0	(None)
	1817	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	(None)
	1791	P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	(None)
	1786	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	(None)
	1780	P1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	(None)
	1770	P1307F Cow and Vacation dfs and similar dsu trees *3300	0 / 0	(None)
	1758	P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.