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

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	739	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	(无)
	722	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	(无)
	714	P1482F Useful Edges graphs shortest paths *2400	0 / 0	(无)
	708	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	(无)
	700	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(无)
	696	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	(无)
	694	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(无)
	668	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	(无)
	650	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(无)
	649	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	(无)
	646	P1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	(无)
	645	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(无)
	643	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	(无)
	636	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	(无)
	630	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	(无)
	629	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(无)
	621	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	(无)
	607	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(无)
	590	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	(无)
	586	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	(无)
	578	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	(无)
	577	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	(无)
	569	P1510K King's Task brute force graphs implementation *1200	0 / 0	(无)
	565	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	(无)
	551	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(无)
	544	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(无)
	538	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(无)
	537	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	(无)
	531	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	(无)
	526	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(无)
	523	P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	(无)
	517	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(无)
	508	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	(无)
	472	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(无)
	464	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	(无)
	439	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(无)
	437	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(无)
	433	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(无)
	431	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(无)
	430	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(无)
	429	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(无)
	427	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(无)
	416	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	(无)
	408	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(无)
	394	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(无)
	393	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(无)
	375	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(无)
	372	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(无)
	359	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(无)
	358	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	(无)

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