trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9036	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	9028	P1930G Prefix Max Set Counting data structures dp trees	0 / 0	(None)
	9027	P1930H Interactive Mex Tree constructive algorithms dfs and similar interactive trees	0 / 0	(None)
	9146	P1935F Andrey's Tree binary search constructive algorithms data structures dfs and similar dsu greedy implementation trees *2800	0 / 0	10
	9107	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	9089	P1946C Tree Cutting binary search dp greedy implementation trees *1600	0 / 0	5
	9079	P1948G MST with Matching bitmasks brute force dsu graph matchings trees *3100	0 / 0	10
	9076	P1949C Annual Ants' Gathering dfs and similar greedy trees	0 / 0	(None)
	9073	P1949F Dating greedy sortings trees	0 / 0	(None)
	9069	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(None)
	9250	P1951H Thanos Snap binary search dp games greedy trees *3200	0 / 0	10
	9212	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	9211	P1957F2 Frequency Mismatch (Hard Version) binary search data structures dfs and similar hashing probabilities trees *2700	0 / 0	10
	9199	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9179	P1970A2 Balanced Unshuffle (Medium) brute force constructive algorithms trees	0 / 0	(None)
	9178	P1970A3 Balanced Unshuffle (Hard) constructive algorithms trees	0 / 0	(None)
	9173	P1970C2 Game on Tree (Medium) dfs and similar dp games trees	0 / 0	(None)
	9172	P1970C3 Game on Tree (Hard) dfs and similar dp games trees	0 / 0	(None)
	9162	P1970G1 Min-Fund Prison (Easy) dfs and similar trees	0 / 0	(None)
	9161	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees	0 / 0	(None)

Pick a problem randomly based on the current filter.