trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	753	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	(None)
	751	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	(None)
	733	P1511C Yet Another Card Deck brute force data structures implementation trees *1100	0 / 0	(None)
	705	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
	691	P1517F Reunion combinatorics dp trees *3200	0 / 0	(None)
	684	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(None)
	671	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
	667	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	(None)
	644	P1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	(None)
	642	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(None)
	640	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	(None)
	638	P1528E Mashtali and Hagh Trees combinatorics dp trees *2900	0 / 0	(None)
	599	P1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	(None)
	594	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(None)
	590	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(None)
	589	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	(None)
	560	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(None)
	526	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
	504	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
	487	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)

Pick a problem randomly based on the current filter.