graphs - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9735	P8B Obsession with Robots constructive algorithms graphs implementation *1400	0 / 0	4
	9732	P8E Beads dp graphs *2600	0 / 0	10
	9727	P9E Interesting Graph and Apples dfs and similar dsu graphs *2300	0 / 0	8
	9718	P11D A Simple Task bitmasks dp graphs *2200	0 / 0	8
	9703	P14D Two Paths dfs and similar dp graphs shortest paths trees two pointers *1900	1 / 1	6
	9674	P20C Dijkstra? graphs shortest paths *1900	0 / 0	6
	9670	P21D Traveling Graph bitmasks graph matchings graphs *2400	0 / 0	9
	9667	P22C System Administrator graphs *1700	0 / 0	5
	9665	P22E Scheme dfs and similar graphs trees *2300	0 / 0	8
	9663	P23B Party constructive algorithms graphs math *1600	0 / 0	5
	9659	P24A Ring road graphs *1400	0 / 0	4
	9652	P25C Roads in Berland graphs shortest paths *1900	0 / 0	6
	9651	P25D Roads not only in Berland dsu graphs trees *1900	0 / 0	6
	9641	P27D Ring Road 2 2-sat dfs and similar dsu graphs *2200	0 / 0	8
	9638	P28B pSort dfs and similar dsu graphs *1600	0 / 0	5
	9632	P29C Mail Stamps data structures dfs and similar graphs implementation *1700	0 / 0	5
	9630	P29E Quarrel graphs shortest paths *2400	0 / 0	9
	9611	P33D Knights geometry graphs shortest paths sortings *2000	0 / 0	7
	9606	P34D Road Map dfs and similar graphs *1600	0 / 0	5
	9595	P36E Two Paths constructive algorithms dsu graphs implementation *2600	0 / 0	10
	9590	P37E Trial for Chief graphs greedy shortest paths *2600	0 / 0	10
	9561	P41E 3-cycles constructive algorithms graphs greedy *1900	0 / 0	6
	9556	P42E Baldman and the military dfs and similar graphs trees *2700	0 / 0	10
	9545	P44F BerPaint geometry graphs *2700	0 / 0	10
	9533	P45H Road Problem graphs *2100	0 / 0	7
	9525	P46F Hercule Poirot Problem dsu graphs *2300	0 / 0	8
	9514	P48E Ivan the Fool VS Gorynych the Dragon dp games graphs *2100	0 / 0	7
	9496	P51E Pentagon combinatorics graphs matrices *2400	0 / 0	9
	9495	P51F Caterpillar dfs and similar dp graphs trees *2800	0 / 0	10
	9457	P59E Shortest Path graphs shortest paths *2000	1 / 2	7
	9448	P61D Eternal Victory dfs and similar graphs greedy shortest paths trees *1800	0 / 0	6
	9443	P62D Wormhouse dfs and similar graphs *2300	0 / 0	8
	9417	P67A Partial Teacher dp graphs greedy implementation *1800	0 / 0	6
	9380	P73D FreeDiv dfs and similar graphs greedy *2200	0 / 0	8
	9375	P74C Chessboard Billiard dfs and similar dsu graphs number theory *2100	0 / 0	7
	9367	P76A Gift dsu graphs sortings trees *2200	0 / 0	8
	9352	P78E Evacuation flows graphs shortest paths *2300	0 / 0	8
	9340	P81E Pairs dfs and similar dp dsu graphs implementation trees *2700	0 / 0	10
	9332	P83C Track graphs greedy shortest paths *2400	0 / 0	9
	9323	P85E Guard Towers binary search dsu geometry graphs sortings *2600	0 / 0	10
	9314	P87D Beautiful Road dfs and similar dp dsu graphs implementation sortings trees *2300	0 / 0	8
	9309	P89B Widget Library dp expression parsing graphs implementation *2300	0 / 0	8
	9301	P91C Ski Base combinatorics dsu graphs *2300	0 / 0	8
	9300	P91D Grocer's Problem constructive algorithms graphs greedy *2600	0 / 0	10
	9290	P94B Friends graphs implementation math *1300	0 / 0	4
	9285	P95E Lucky Country dp dsu graphs *2500	0 / 0	9
	9280	P97C Winning Strategy binary search graphs math shortest paths *2400	0 / 0	9
	9278	P97E Leaders dfs and similar dsu graphs trees *2200	0 / 0	8
	9252	P103B Cthulhu dfs and similar dsu graphs *1500	0 / 0	5
	9237	P107A Dorm Water Supply dfs and similar graphs *1400	0 / 0	4
	9234	P107D Crime Management dp graphs matrices *2400	0 / 0	9
	9210	P114B PFAST Inc. bitmasks brute force graphs *1500	0 / 0	5
	9209	P115A Party dfs and similar graphs trees *900	0 / 0	3
	9200	P117C Cycle dfs and similar graphs *2000	0 / 0	7
	9193	P118E Bertown roads dfs and similar graphs *2000	0 / 0	7
	9159	P125E MST Company binary search graphs *2400	0 / 0	9
	9145	P129B Students and Shoelaces brute force dfs and similar graphs implementation *1200	0 / 0	4
	9131	P131D Subway dfs and similar graphs *1600	0 / 0	5
	9124	P132E Bits of merry old England flows graphs *2700	0 / 0	10
	9119	P134C Swaps constructive algorithms graphs greedy *2200	0 / 0	8
	9090	P141D Take-off Ramps graphs shortest paths *2300	0 / 0	8
	9089	P141E Clearing Up constructive algorithms dp dsu graphs *2300	0 / 0	8
	9078	P144D Missile Silos data structures dfs and similar graphs shortest paths *1900	0 / 0	6
	9068	P147B Smile House binary search graphs matrices *2500	0 / 0	9
	9056	P150B Quantity of Strings combinatorics dfs and similar graphs math *1600	0 / 0	5
	9046	P152E Garden bitmasks dp graphs trees *2500	0 / 0	9
	9038	P154C Double Profiles graphs hashing sortings *2300	0 / 0	8
	9030	P156D Clues combinatorics graphs *2500	0 / 0	9
	9013	P160D Edges in MST dfs and similar dsu graphs sortings *2300	0 / 0	8
	8991	P164A Variable, or There and Back Again dfs and similar graphs *1700	0 / 0	5
	8989	P164C Machine Programming flows graphs *2400	0 / 0	9
	8973	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	10
	8972	P167E Wizards and Bets dfs and similar graphs math matrices *2900	0 / 0	10
	8951	P173D Deputies constructive algorithms graphs greedy implementation *2500	0 / 0	9
	8941	P175F Gnomes of Might and Magic data structures graphs implementation shortest paths *3000	0 / 0	10
	8931	P177C1 Party dfs and similar dsu graphs *1500	0 / 0	5
	8930	P177C2 Party brute force dfs and similar dsu graphs *1500	0 / 0	5
	8895	P182A Battlefield geometry graphs implementation shortest paths *2200	0 / 0	8
	8859	P190E Counter Attack data structures dsu graphs hashing sortings *2100	0 / 0	7
	8855	P191D Metro Scheme graphs greedy *2700	0 / 0	10
	8851	P193A Cutting Figure constructive algorithms graphs trees *1700	0 / 0	5
	8836	P195E Building Forest data structures dsu graphs *2000	0 / 0	7
	8834	P196B Infinite Maze dfs and similar graphs *2000	0 / 0	7
	8831	P196E Opening Portals dsu graphs shortest paths *2600	0 / 0	10
	8745	P208C Police Station dp graphs shortest paths *1900	0 / 0	6
	8740	P209C Trails and Glades constructive algorithms dsu graphs greedy *2400	0 / 0	9
	8739	P212A Privatization flows graphs *3000	0 / 0	10
	8717	P217A Ice Skating brute force dfs and similar dsu graphs *1200	0 / 0	4
	8707	P219D Choosing Capital for Treeland dfs and similar dp graphs trees *1700	0 / 0	5
	8690	P223D Spider geometry graphs *3000	0 / 0	10
	8689	P223E Planar Graph flows geometry graphs *3000	0 / 0	10
	8683	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	8
	8670	P228E The Road to Berland is Paved With Good Intentions 2-sat dfs and similar dsu graphs *1900	0 / 0	6
	8668	P229B Planets binary search data structures graphs shortest paths *1700	1 / 1	5
	8667	P229C Triangles combinatorics graphs math *1900	0 / 0	6
	8658	P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	7
	8657	P232A Cycles binary search constructive algorithms graphs greedy *1600	0 / 0	5
	8655	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	10
	8639	P235D Graph Game graphs *3000	0 / 0	10
	8632	P237D T-decomposition dfs and similar graphs greedy trees *2000	0 / 0	7

Pick a problem randomly based on the current filter.