trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5456	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	5469	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	5471	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
	5472	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
	5484	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(None)
	5485	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(None)
	5488	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(None)
	5489	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
	5515	P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	(None)
	5525	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(None)
	5526	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
	5534	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
	5538	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
	5540	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(None)
	5545	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	(None)
	5552	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(None)
	5553	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(None)
	5567	P1413F Roads and Ramen data structures trees *2800	0 / 0	(None)
	5573	P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	(None)
	5597	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(None)

Pick a problem randomly based on the current filter.