题库 - graphs - 南阳理工学院OJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	6900	P107D Crime Management dp graphs matrices *2400	0 / 0	(无)
	6876	P114B PFAST Inc. bitmasks brute force graphs *1500	0 / 0	(无)
	6875	P115A Party dfs and similar graphs trees *900	0 / 0	(无)
	6866	P117C Cycle dfs and similar graphs *2000	0 / 0	(无)
	6859	P118E Bertown roads dfs and similar graphs *2000	0 / 0	(无)
	6825	P125E MST Company binary search graphs *2400	0 / 0	(无)
	6811	P129B Students and Shoelaces brute force dfs and similar graphs implementation *1200	0 / 0	(无)
	6797	P131D Subway dfs and similar graphs *1600	0 / 0	(无)
	6790	P132E Bits of merry old England flows graphs *2700	0 / 0	(无)
	6785	P134C Swaps constructive algorithms graphs greedy *2200	0 / 0	(无)
	6756	P141D Take-off Ramps graphs shortest paths *2300	0 / 0	(无)
	6755	P141E Clearing Up constructive algorithms dp dsu graphs *2300	0 / 0	(无)
	6744	P144D Missile Silos data structures dfs and similar graphs shortest paths *1900	0 / 0	(无)
	6734	P147B Smile House binary search graphs matrices *2500	0 / 0	(无)
	6722	P150B Quantity of Strings combinatorics dfs and similar graphs math *1600	0 / 0	(无)
	6712	P152E Garden bitmasks dp graphs trees *2500	0 / 0	(无)
	6704	P154C Double Profiles graphs hashing sortings *2300	0 / 0	(无)
	6696	P156D Clues combinatorics graphs *2500	0 / 0	(无)
	6679	P160D Edges in MST dfs and similar dsu graphs sortings *2300	0 / 0	(无)
	6657	P164A Variable, or There and Back Again dfs and similar graphs *1700	0 / 0	(无)
	6655	P164C Machine Programming flows graphs *2400	0 / 0	(无)
	6639	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	(无)
	6638	P167E Wizards and Bets dfs and similar graphs math matrices *2900	0 / 0	(无)
	6617	P173D Deputies constructive algorithms graphs greedy implementation *2500	0 / 0	(无)
	6607	P175F Gnomes of Might and Magic data structures graphs implementation shortest paths *3000	0 / 0	(无)
	6597	P177C1 Party dfs and similar dsu graphs *1500	0 / 0	(无)
	6596	P177C2 Party brute force dfs and similar dsu graphs *1500	0 / 0	(无)
	6561	P182A Battlefield geometry graphs implementation shortest paths *2200	0 / 0	(无)
	6525	P190E Counter Attack data structures dsu graphs hashing sortings *2100	0 / 0	(无)
	6521	P191D Metro Scheme graphs greedy *2700	0 / 0	(无)
	6517	P193A Cutting Figure constructive algorithms graphs trees *1700	0 / 0	(无)
	6506	P195E Building Forest data structures dsu graphs *2000	0 / 0	(无)
	6504	P196B Infinite Maze dfs and similar graphs *2000	0 / 0	(无)
	6501	P196E Opening Portals dsu graphs shortest paths *2600	0 / 0	(无)
	6446	P208C Police Station dp graphs shortest paths *1900	0 / 0	(无)
	6441	P209C Trails and Glades constructive algorithms dsu graphs greedy *2400	0 / 0	(无)
	6440	P212A Privatization flows graphs *3000	0 / 0	(无)
	6418	P217A Ice Skating brute force dfs and similar dsu graphs *1200	0 / 0	(无)
	6408	P219D Choosing Capital for Treeland dfs and similar dp graphs trees *1700	0 / 0	(无)
	6391	P223D Spider geometry graphs *3000	0 / 0	(无)
	6390	P223E Planar Graph flows geometry graphs *3000	0 / 0	(无)
	6384	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	(无)
	6371	P228E The Road to Berland is Paved With Good Intentions 2-sat dfs and similar dsu graphs *1900	0 / 0	(无)
	6369	P229B Planets binary search data structures graphs shortest paths *1700	0 / 0	(无)
	6368	P229C Triangles combinatorics graphs math *1900	0 / 0	(无)
	6359	P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	(无)
	6358	P232A Cycles binary search constructive algorithms graphs greedy *1600	0 / 0	(无)
	6356	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	(无)
	6340	P235D Graph Game graphs *3000	0 / 0	(无)
	6333	P237D T-decomposition dfs and similar graphs greedy trees *2000	0 / 0	(无)

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