shortest paths - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5520	P954D Fight Against Traffic dfs and similar graphs shortest paths *1600	1 / 2	5
	5398	P983C Elevator dp graphs shortest paths *2400	0 / 0	9
	5386	P986A Fair graphs greedy number theory shortest paths *1600	1 / 1	5
	5381	P986F Oppa Funcan Style Remastered graphs math number theory shortest paths *3300	0 / 0	10
	5278	P1004E Sonya and Ice Cream binary search data structures dp greedy shortest paths trees *2400	0 / 0	9
	5270	P1005F Berland and the Shortest Paths brute force dfs and similar graphs shortest paths *2100	0 / 0	7
	5127	P1037D Valid BFS? dfs and similar graphs shortest paths trees *1700	0 / 0	5
	5092	P1043F Make It One bitmasks combinatorics dp math number theory shortest paths *2500	0 / 0	9
	5064	P1051F The Shortest Statement graphs shortest paths trees *2400	0 / 0	9
	5009	P1063B Labyrinth graphs shortest paths *1800	0 / 0	6
	4999	P1065D Three Pieces dfs and similar dp shortest paths *2200	0 / 0	8
	4988	P1067B Multihedgehog dfs and similar graphs shortest paths *1800	0 / 0	6
	4981	P1070A Find a Number dp graphs number theory shortest paths *2200	0 / 0	8
	4955	P1076D Edge Deletion graphs greedy shortest paths *1800	1 / 2	6
	4934	P1081D Maximum Distance dsu graphs shortest paths sortings *1800	0 / 0	6
	4791	P1105D Kilani and the Game dfs and similar graphs implementation shortest paths *1900	0 / 0	6
	4786	P1106D Lunar New Year and a Wander data structures dfs and similar graphs greedy shortest paths *1500	0 / 0	5
	4636	P1140G Double Tree data structures divide and conquer shortest paths trees *2700	0 / 0	10
	4511	P1163F Indecisive Taxi Fee data structures graphs shortest paths *3000	0 / 0	10
	4448	P1176E Cover it! dfs and similar dsu graphs shortest paths trees *1700	0 / 0	5
	4412	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	7
	4404	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	8
	4403	P1184B3 The Doctor Meets Vader (Hard) flows shortest paths *2700	0 / 0	10
	4396	P1184E2 Daleks' Invasion (medium) dfs and similar graphs shortest paths trees *2100	0 / 0	7
	4330	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	8
	4325	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	8
	4305	P1201E1 Knightmare (easy) graphs interactive shortest paths *2900	0 / 0	10
	4304	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	10
	4302	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	5
	4287	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	5
	4282	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	6
	4254	P1209F Koala and Notebook data structures dfs and similar graphs shortest paths strings trees *2600	0 / 0	10
	4192	P1218G Alpha planetary system constructive algorithms graphs shortest paths *3000	0 / 0	10
	4153	P1227E Arson In Berland Forest binary search graphs graphs shortest paths *2200	0 / 0	8
	4085	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	1 / 1	6
	4084	P1245E Hyakugoku and Ladders dp probabilities shortest paths *2300	0 / 0	8
	4071	P1249E By Elevator or Stairs? dp shortest paths *1700	0 / 0	5
	4061	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
	4010	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	9
	3827	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	6
	3750	P1283D Christmas Trees graphs greedy shortest paths *1800	0 / 0	6
	3608	P1301F Super Jaber dfs and similar graphs implementation shortest paths *2600	0 / 0	10
	3586	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3572	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3569	P1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	10
	3509	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5
	3503	P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3469	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
	3343	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	9
	3327	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	3300	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	3219	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	4
	3192	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	5
	3154	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	3153	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	3072	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	10
	3048	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	3042	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	2975	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2930	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	5
	2909	P1421D Hexagons brute force constructive algorithms greedy implementation math shortest paths *1900	0 / 0	6
	2904	P1422D Returning Home graphs shortest paths sortings *2300	1 / 5	8
	2831	P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	7
	2820	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	5
	2800	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	9
	2771	P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	10
	2602	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2597	P1473E Minimum Path graphs shortest paths *2400	0 / 0	9
	2517	P1482D Playlist data structures dsu implementation shortest paths *1900	0 / 0	6
	2515	P1482F Useful Edges graphs shortest paths *2400	0 / 0	9
	2501	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	2497	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2490	P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2413	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	10
	2354	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2344	P1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	6
	2330	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2234	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	6
	2213	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2162	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	9
	2121	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	8
	2097	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	8
	2071	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	2036	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	2009	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	1923	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1886	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	1794	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	10
	1767	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	5
	1761	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	10
	1653	P1599G Shortest path brute force geometry math shortest paths *2700	0 / 0	10
	1642	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	1558	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	5
	1557	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1549	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1528	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1514	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1484	P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	10
	1446	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1443	P1627F Not Splitting geometry graphs greedy implementation shortest paths *2700	0 / 0	10

Pick a problem randomly based on the current filter.