graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5217	P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	(None)
	5225	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	(None)
	5227	P1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	(None)
	5249	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	(None)
	5262	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
	5265	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	(None)
	5272	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	(None)
	5273	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	(None)
	5277	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	(None)
	5278	P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	(None)
	5297	P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	(None)
	5311	P1338E JYPnation graphs *3500	0 / 0	(None)
	5313	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	(None)
	5314	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	(None)
	5315	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	(None)
	5325	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	(None)
	5327	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	(None)
	5333	P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	(None)
	5340	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	(None)
	5389	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(None)

Pick a problem randomly based on the current filter.