Problem Set - trees - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	231	P1851F Lisa and the Martians bitmasks greedy math strings trees *1800	0 / 0	6
	230	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers *2000	0 / 0	7
	217	P1854D Michael and Hotel binary search interactive trees *3000	0 / 0	10
	208	P1856E1 PermuTree (easy version) dfs and similar dp trees *1800	0 / 0	6
	207	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	203	P1857D Strong Vertices math sortings trees *1300	0 / 0	4
	200	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	195	P1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	9
	194	P1858E2 Rollbacks (Hard Version) data structures interactive trees *2600	0 / 0	10
	188	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	179	P1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	5
	161	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	160	P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	155	P1864E Guess Game bitmasks data structures games math probabilities sortings strings trees *2100	0 / 0	7
	140	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	127	P1868C Travel Plan combinatorics dp implementation math trees *2400	0 / 0	9
	126	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	114	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	99	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	84	P1876E Ball-Stackable constructive algorithms data structures dp trees *3300	0 / 0	10
	82	P1876G Clubstep binary search brute force data structures greedy trees *3500	0 / 0	10
	73	P1878G wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees *2300	0 / 0	8
	68	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	61	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees *1700	0 / 0	5
	56	P1882D Tree XOR bitmasks dfs and similar dp greedy trees *1900	0 / 0	6
	32	P1887D Split binary search data structures divide and conquer dsu math trees two pointers *2700	0 / 0	10
	25	P1889D Game of Stacks brute force dfs and similar graphs implementation trees *3000	0 / 0	10
	24	P1889E Doremy's Swapping Trees dfs and similar graphs trees *3500	0 / 0	10
	23	P1889F Doremy's Average Tree data structures dp greedy trees *3500	0 / 0	10
	15	P1891F A Growing Tree data structures dfs and similar trees *2000	0 / 0	7
	4	P1895D XOR Construction bitmasks constructive algorithms data structures math string suffix structures trees *1900	0 / 0	6
	5066	P1899F Alex's whims constructive algorithms graphs shortest paths trees	0 / 0	(None)
	5065	P1899G Unusual Entertainment data structures dfs and similar dsu shortest paths sortings trees two pointers	0 / 0	(None)
	5347	P1900C Anji's Binary Tree dfs and similar dp shortest paths trees *1300	0 / 0	4
	5135	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	6621	P1902E Collapsing Strings data structures strings trees *1900	0 / 0	6
	6620	P1902F Trees and XOR Queries Again data structures dfs and similar divide and conquer graphs implementation math trees *2400	0 / 0	9
	5337	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	6705	P1904E Tree Queries data structures dfs and similar graphs implementation trees *2500	0 / 0	9
	6704	P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	6702	P1905B Begginer's Zelda greedy trees *1100	0 / 0	3
	6699	P1905E One-X combinatorics dfs and similar dp math trees *2400	0 / 0	9
	6682	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	6662	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	6653	P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	6652	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	6639	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	6637	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	6629	P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	8202	P1918F Caterpillar on a Tree data structures dfs and similar dp graphs greedy implementation sortings trees *2500	0 / 0	9
	7322	P1919D 01 Tree constructive algorithms data structures divide and conquer dp dsu greedy implementation sortings trees *2100	0 / 0	7
	7318	P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 0	10
	7317	P1919H Tree Diameter interactive trees *3500	0 / 0	10
	8194	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	8926	P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(None)
	8918	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	8912	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	8901	P1929D Sasha and a Walk in the City combinatorics dp math trees *1900	0 / 0	6
	8900	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8899	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	8891	P1930G Prefix Max Set Counting data structures dp trees	0 / 0	(None)
	8890	P1930H Interactive Mex Tree constructive algorithms dfs and similar interactive trees	0 / 0	(None)
	8856	P1935F Andrey's Tree binary search constructive algorithms data structures dfs and similar dsu greedy implementation trees	0 / 0	(None)
	9389	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	9388	P1957F2 Frequency Mismatch (Hard Version) binary search data structures dfs and similar hashing probabilities trees *2700	0 / 0	10
	9366	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9346	P1970A2 Balanced Unshuffle (Medium) brute force constructive algorithms trees *2400	0 / 0	9
	9345	P1970A3 Balanced Unshuffle (Hard) constructive algorithms trees *2400	0 / 0	9
	9340	P1970C2 Game on Tree (Medium) dfs and similar dp games trees *1700	0 / 0	5
	9339	P1970C3 Game on Tree (Hard) dfs and similar dp games trees *1900	0 / 0	6
	9329	P1970G1 Min-Fund Prison (Easy) dfs and similar trees *1900	0 / 0	6
	9328	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	9327	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	9
	9300	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees	0 / 0	(None)
	9299	P1975E Chain Queries binary search data structures dfs and similar implementation trees	0 / 0	(None)

Pick a problem randomly based on the current filter.