shortest paths - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1403	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	9
	1402	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	10
	1329	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1318	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	1314	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths *1900	0 / 0	6
	1305	P1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	10
	1267	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1257	P1662F Antennas data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths	0 / 0	(None)
	1225	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	7
	1131	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1130	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	1073	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	1045	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1033	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1023	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	909	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	7
	888	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	833	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	6
	827	P1726F Late For Work (submissions are not allowed) data structures greedy schedules shortest paths *2900	0 / 0	10
	762	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	752	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
	720	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	639	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	612	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	587	P1759C Thermostat greedy math shortest paths *1100	0 / 0	3
	502	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	401	P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
	382	P1776J Italian Data Centers graphs shortest paths *2500	0 / 0	9
	347	P1779G The Game of the Century constructive algorithms graphs shortest paths *3000	0 / 0	10
	271	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	269	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	160	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	144	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	48	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7
	9835	P1833E Round Dance dfs and similar dsu graphs shortest paths *1600	0 / 0	5
	9926	P1842F Tenzing and Tree dfs and similar greedy shortest paths sortings trees *2500	0 / 0	9
	9893	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	9970	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	9965	P1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths	0 / 0	(None)
	10055	P1869B 2D Traveling geometry math shortest paths sortings	0 / 0	(None)
	10126	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	10115	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	10113	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths	0 / 0	(None)
	10165	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(None)
	10150	P1887B Time Travel binary search graphs shortest paths	0 / 0	(None)
	10204	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	10198	P1899F Alex's whims constructive algorithms graphs greedy shortest paths trees *1600	0 / 0	5
	10197	P1899G Unusual Entertainment data structures dfs and similar dsu shortest paths sortings trees two pointers *1900	0 / 0	6
	10194	P1900C Anji's Binary Tree dfs and similar dp shortest paths trees *1300	0 / 0	4
	10287	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	10263	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	10340	P1924A Did We Get Everything Covered? constructive algorithms dp greedy shortest paths strings *1500	0 / 0	5
	10410	P1932G Moving Platforms graphs math number theory shortest paths *2300	0 / 0	8
	10404	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths *2100	0 / 0	7
	10388	P1936C Pokémon Arena data structures graphs greedy implementation shortest paths sortings *2400	0 / 0	9
	10355	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	10352	P1948C Arrow Path dfs and similar dp graphs shortest paths shortest paths	0 / 0	(None)
	10482	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths	0 / 0	(None)
	10618	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers *2800	0 / 0	10
	10553	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5

Pick a problem randomly based on the current filter.