trees - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	642	P1851F Lisa and the Martians bitmasks greedy math strings trees *1800	0 / 0	6
	641	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers *2000	0 / 0	7
	628	P1854D Michael and Hotel binary search interactive trees *3000	0 / 0	10
	619	P1856E1 PermuTree (easy version) dfs and similar dp trees *1800	0 / 0	6
	618	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	614	P1857D Strong Vertices math sortings trees *1300	0 / 0	4
	611	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	606	P1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	9
	605	P1858E2 Rollbacks (Hard Version) data structures interactive trees *2600	0 / 0	10
	599	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	590	P1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	5
	572	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	571	P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	566	P1864E Guess Game bitmasks data structures games math probabilities sortings strings trees *2100	0 / 0	7
	551	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	538	P1868C Travel Plan combinatorics dp implementation math trees *2400	0 / 0	9
	537	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	525	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	510	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	495	P1876E Ball-Stackable constructive algorithms data structures dp trees *3300	0 / 0	10
	493	P1876G Clubstep binary search brute force data structures greedy trees *3500	0 / 0	10
	484	P1878G wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees *2300	0 / 0	8
	479	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	472	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees *1700	0 / 0	5
	467	P1882D Tree XOR bitmasks dfs and similar dp greedy trees *1900	0 / 0	6
	442	P1887D Split binary search data structures divide and conquer dsu math trees two pointers *2700	0 / 0	10
	435	P1889D Game of Stacks brute force dfs and similar graphs implementation trees *3000	0 / 0	10
	434	P1889E Doremy's Swapping Trees dfs and similar graphs trees *3500	0 / 0	10
	433	P1889F Doremy's Average Tree data structures dp greedy trees *3500	0 / 0	10
	425	P1891F A Growing Tree data structures dfs and similar trees *2000	0 / 0	7
	414	P1895D XOR Construction bitmasks constructive algorithms data structures math string suffix structures trees *1900	0 / 0	6
	390	P1899F Alex's whims constructive algorithms graphs greedy shortest paths trees *1600	0 / 0	5
	389	P1899G Unusual Entertainment data structures dfs and similar dsu shortest paths sortings trees two pointers *1900	0 / 0	6
	386	P1900C Anji's Binary Tree dfs and similar dp trees *1300	0 / 0	4
	378	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	372	P1902E Collapsing Strings data structures strings trees *1900	0 / 0	6
	371	P1902F Trees and XOR Queries Again data structures dfs and similar divide and conquer graphs implementation math trees *2400	0 / 0	9
	364	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	358	P1904E Tree Queries data structures dfs and similar graphs implementation trees *2500	0 / 0	9
	357	P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	355	P1905B Begginer's Zelda greedy trees *1100	0 / 0	3
	352	P1905E One-X combinatorics dfs and similar dp math trees *2400	0 / 0	9
	315	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	295	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	286	P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	285	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	272	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	270	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	262	P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	256	P1918F Caterpillar on a Tree dfs and similar graphs greedy implementation sortings trees *2500	0 / 0	9
	251	P1919D 01 Tree constructive algorithms data structures dsu greedy sortings trees *2100	0 / 0	7
	247	P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 0	10
	246	P1919H Tree Diameter interactive trees *2000	0 / 0	7
	239	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	221	P1923E Count Paths data structures dfs and similar dp dsu graphs trees *2000	0 / 0	7
	204	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees *1900	0 / 0	6
	198	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	187	P1929D Sasha and a Walk in the City combinatorics dp math trees *1900	0 / 0	6
	186	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	185	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	177	P1930G Prefix Max Set Counting data structures dp trees *3100	0 / 0	10
	176	P1930H Interactive Mex Tree constructive algorithms dfs and similar interactive trees *3300	0 / 0	10
	142	P1935F Andrey's Tree binary search constructive algorithms data structures dfs and similar dsu greedy implementation trees *2800	0 / 0	10
	97	P1942H Farmer John's Favorite Intern data structures dp flows trees *3500	0 / 0	10
	94	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	76	P1946C Tree Cutting binary search dp greedy implementation trees *1600	0 / 0	5
	66	P1948G MST with Matching bitmasks brute force dsu graph matchings trees *3100	0 / 0	10
	63	P1949C Annual Ants' Gathering dfs and similar dp greedy trees	0 / 0	(无)
	60	P1949F Dating greedy sortings trees	0 / 0	(无)
	56	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(无)
	49	P1950F 0, 1, 2, Tree! bitmasks brute force greedy implementation trees *1700	0 / 0	5
	40	P1951H Thanos Snap binary search dp games greedy trees *3200	0 / 0	10
	2	P1957F1 Frequency Mismatch (Easy Version) binary search data structures hashing probabilities trees two pointers	0 / 0	(无)
	1	P1957F2 Frequency Mismatch (Hard Version) binary search data structures dfs and similar hashing trees	1 / 1	10
	9493	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5
	9492	P1975E Chain Queries binary search data structures dfs and similar implementation trees *2100	0 / 0	7
	9483	P1976E Splittable Permutations combinatorics data structures dfs and similar greedy math trees *2500	0 / 0	9
	9482	P1976F Remove Bridges data structures dfs and similar dp greedy sortings trees *2800	0 / 0	10
	9457	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs greedy strings trees *2300	0 / 0	8
	9451	P1981F Turtle and Paths on a Tree data structures dp trees *3000	0 / 0	10
	9439	P1984E Shuffle dp greedy trees *2400	0 / 0	9

根据当前过滤条件随机选择一道题