题库 - graphs - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	6601	P107D Crime Management dp graphs matrices *2400	0 / 0	9
	6577	P114B PFAST Inc. bitmasks brute force graphs *1500	0 / 0	5
	6576	P115A Party dfs and similar graphs trees *900	0 / 0	3
	6567	P117C Cycle dfs and similar graphs *2000	1 / 1	7
	6560	P118E Bertown roads dfs and similar graphs *2000	0 / 0	7
	6526	P125E MST Company binary search graphs *2400	0 / 0	9
	6512	P129B Students and Shoelaces brute force dfs and similar graphs implementation *1200	0 / 0	4
	6508	P131D Subway dfs and similar graphs *1600	0 / 0	5
	6501	P132E Bits of merry old England flows graphs *2700	0 / 0	10
	6496	P134C Swaps constructive algorithms graphs greedy *2200	0 / 0	8
	6467	P141D Take-off Ramps graphs shortest paths *2300	0 / 1	8
	6466	P141E Clearing Up constructive algorithms dp dsu graphs *2300	0 / 0	8
	6455	P144D Missile Silos data structures dfs and similar graphs shortest paths *1900	0 / 0	6
	6445	P147B Smile House binary search graphs matrices *2500	0 / 0	9
	6433	P150B Quantity of Strings combinatorics dfs and similar graphs math *1600	0 / 0	5
	6423	P152E Garden bitmasks dp graphs trees *2500	0 / 0	9
	6420	P154C Double Profiles graphs hashing sortings *2300	0 / 0	8
	6412	P156D Clues combinatorics graphs *2500	0 / 0	9
	6395	P160D Edges in MST dfs and similar dsu graphs sortings *2300	0 / 0	8
	6383	P164A Variable, or There and Back Again dfs and similar graphs *1700	0 / 0	5
	6381	P164C Machine Programming flows graphs *2400	0 / 0	9
	6365	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	10
	6364	P167E Wizards and Bets dfs and similar graphs math matrices *2900	0 / 0	10
	6345	P173D Deputies constructive algorithms graphs greedy implementation *2500	0 / 0	9
	6334	P175F Gnomes of Might and Magic data structures graphs implementation shortest paths *3000	0 / 0	10
	6323	P177C1 Party dfs and similar dsu graphs *1500	0 / 0	5
	6322	P177C2 Party brute force dfs and similar dsu graphs *1500	0 / 0	5
	6275	P182A Battlefield geometry graphs implementation shortest paths *2200	0 / 0	8
	6232	P190E Counter Attack data structures dsu graphs hashing sortings *2100	0 / 0	7
	6226	P191D Metro Scheme graphs greedy *2700	0 / 0	10
	6220	P193A Cutting Figure constructive algorithms graphs trees *1700	1 / 1	5
	6206	P195E Building Forest data structures dsu graphs *2000	0 / 0	7
	6203	P196B Infinite Maze dfs and similar graphs *2000	0 / 0	7
	6198	P196E Opening Portals dsu graphs shortest paths *2600	0 / 0	10
	6116	P208C Police Station dp graphs shortest paths *1900	0 / 0	6
	6111	P209C Trails and Glades constructive algorithms dsu graphs greedy *2400	1 / 1	9
	6110	P212A Privatization flows graphs *3000	1 / 4	10
	6088	P217A Ice Skating brute force dfs and similar dsu graphs *1200	0 / 0	4
	6078	P219D Choosing Capital for Treeland dfs and similar dp graphs trees *1700	0 / 0	5
	6063	P223D Spider geometry graphs *3000	0 / 0	10
	6060	P223E Planar Graph flows geometry graphs *3000	0 / 0	10
	6054	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	8
	6042	P228E The Road to Berland is Paved With Good Intentions 2-sat dfs and similar dsu graphs *1900	2 / 2	6
	6039	P229B Planets binary search data structures graphs shortest paths *1700	0 / 0	5
	6038	P229C Triangles combinatorics graphs math *1900	0 / 0	6
	6029	P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	7
	6028	P232A Cycles binary search constructive algorithms graphs greedy *1600	0 / 0	5
	6026	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	10
	6010	P235D Graph Game graphs *3000	0 / 0	10
	6003	P237D T-decomposition dfs and similar graphs greedy trees *2000	0 / 0	7

根据当前过滤条件随机选择一道题