题库 - graphs - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1236	P1310D Tourism dp graphs probabilities *2300	0 / 0	8
	1208	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7
	1204	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5
	1195	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	8
	1186	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	1180	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	1 / 2	10
	1178	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	9
	1167	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
	1166	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	1158	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	6
	1157	P1328E Tree Queries dfs and similar graphs trees *1900	2 / 4	6
	1130	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	1124	P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	6
	1123	P1334E Divisor Paths combinatorics graphs greedy math number theory *2200	1 / 2	8
	1114	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	8
	1107	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	1101	P1338E JYPnation graphs *3500	1 / 6	10
	1096	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	5
	1095	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	1 / 6	9
	1094	P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	10
	1093	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	10
	1080	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	1077	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	1075	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	10
	1067	P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	5
	1066	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	5
	1056	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	10
	1053	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	1025	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	971	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	4
	967	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	5
	965	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	963	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	10
	949	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	7
	944	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	5
	935	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	929	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	922	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	9
	920	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	914	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	906	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	1 / 1	9
	905	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	871	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	846	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	843	P1383C String Transformation 2 bitmasks dp graphs trees *3100	1 / 1	10
	844	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	2 / 3	10
	841	P1383F Special Edges flows graphs *3200	1 / 1	10
	833	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	1 / 2	7
	831	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	8
	820	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7

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