graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	745	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	(None)
	744	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	(None)
	736	P1510K King's Task brute force graphs implementation *1200	0 / 0	(None)
	732	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	(None)
	718	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(None)
	711	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
	705	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
	704	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	(None)
	698	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	(None)
	693	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(None)
	690	P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	(None)
	684	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(None)
	675	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	(None)
	639	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(None)
	631	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	(None)
	606	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	604	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	600	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(None)
	598	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(None)
	597	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.