shortest paths - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5434	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
	5549	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(None)
	5578	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	(None)
	5644	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	(None)
	5776	P1482F Useful Edges graphs shortest paths *2400	0 / 0	(None)
	5783	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(None)
	5842	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	5848	P1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	(None)
	5892	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(None)
	5928	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(None)
	5953	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(None)
	5964	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	(None)
	5977	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(None)
	5996	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(None)
	6006	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	6037	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	6055	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
	6086	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	(None)
	6099	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	(None)
	6103	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	(None)

Pick a problem randomly based on the current filter.