graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8999	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8998	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	9063	P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(None)
	9055	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	9049	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	9043	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	9037	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	9020	P1931F Chat Screenshots combinatorics dfs and similar graphs *1700	0 / 0	5
	9012	P1932G Moving Platforms graphs math number theory shortest paths	0 / 0	(None)
	9006	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths	0 / 0	(None)
	9143	P1936C Pokémon Arena data structures graphs greedy implementation shortest paths sortings *2400	0 / 0	9
	9110	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	9101	P1944A Destroying Bridges graphs greedy math *800	0 / 0	3
	9083	P1948C Arrow Path brute force constructive algorithms dfs and similar dp graphs shortest paths *1300	0 / 0	4
	9081	P1948E Clique Partition brute force constructive algorithms graphs greedy implementation *2100	0 / 0	7
	9072	P1949G Scooter graphs greedy	0 / 0	(None)
	9070	P1949I Disks dfs and similar geometry graph matchings graphs	0 / 0	(None)
	9069	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(None)
	9249	P1951I Growing Trees binary search constructive algorithms flows graphs greedy *3200	0 / 0	10
	9218	P1956F Nene and the Passing Game constructive algorithms data structures dsu graphs sortings *3000	0 / 0	10

Pick a problem randomly based on the current filter.