shortest paths - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	73	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
	72	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(None)
	5	P1648D Serious Business data structures dp shortest paths	0 / 0	(None)
	5211	P1650G Counting Shortcuts dfs and similar dp graphs shortest paths	0 / 0	(None)
	7602	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths	0 / 0	(None)
	7619	P1654G Snowy Mountain data structures graphs greedy shortest paths trees *2900	0 / 0	(None)
	7691	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	(None)
	7690	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	(None)
	7654	P1689D Lena and Matrix data structures dp shortest paths *1900	0 / 0	(None)
	7751	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	(None)
	7743	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	(None)
	7736	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths	0 / 0	(None)
	7872	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths	0 / 0	(None)
	7896	P1725M Moving Both Hands dp graphs shortest paths	0 / 0	(None)
	7911	P1726F Late For Work data structures greedy schedules shortest paths	0 / 0	(None)
	7970	P1737D Ela and the Wiring Wizard graphs greedy shortest paths	0 / 0	(None)
	7957	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths sortings trees	0 / 0	(None)
	7983	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths	0 / 0	(None)
	8019	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths	0 / 0	(None)
	8028	P1753D The Beach graphs greedy implementation shortest paths *2400	0 / 0	9

Pick a problem randomly based on the current filter.