graph matchings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4594	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	(None)
	4678	P1139E Maximize Mex flows graph matchings graphs *2400	0 / 0	(None)
	4809	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	(None)
	4827	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	(None)
	5011	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	(None)
	5153	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	(None)
	5359	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	5388	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(None)
	5456	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	5493	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(None)
	5542	P1404E Bricks flows graph matchings graphs *2800	0 / 0	(None)
	5737	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	(None)
	5743	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	(None)
	5862	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	(None)
	5917	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	(None)
	5950	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	5990	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(None)
	6002	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	6114	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	6196	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.