graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1605	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	(None)
	1604	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	(None)
	1595	P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	(None)
	1594	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	(None)
	1584	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	(None)
	1581	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	(None)
	1553	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	(None)
	1500	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(None)
	1496	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(None)
	1494	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
	1492	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
	1478	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(None)
	1473	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(None)
	1464	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
	1458	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
	1451	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
	1449	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(None)
	1443	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
	1435	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
	1434	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.