graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4387	P1038E Maximum Matching bitmasks brute force dfs and similar dp graphs *2400	0 / 0	(None)
	4395	P1041E Tree Reconstruction constructive algorithms data structures graphs greedy *1900	0 / 0	(None)
	4400	P1042F Leaf Sets data structures dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	(None)
	4410	P1045C Hyperspace Highways dfs and similar graphs trees *2300	0 / 0	(None)
	4428	P1055A Metro graphs *900	0 / 0	(None)
	4433	P1056D Decorate Apple Tree constructive algorithms dfs and similar dp graphs greedy sortings trees *1600	0 / 0	(None)
	4435	P1056G Take Metro brute force data structures graphs *2900	0 / 0	(None)
	4452	P1062D Fun with Integers dfs and similar graphs implementation math *1800	0 / 0	(None)
	4453	P1062F Upgrading Cities dfs and similar graphs *2900	0 / 0	(None)
	4454	P1063B Labyrinth graphs shortest paths *1800	0 / 0	(None)
	4459	P1065B Vasya and Isolated Vertices constructive algorithms graphs *1300	0 / 0	(None)
	4467	P1067B Multihedgehog dfs and similar graphs shortest paths *1800	0 / 0	(None)
	4471	P1068C Colored Rooks constructive algorithms graphs *1700	0 / 0	(None)
	4472	P1070A Find a Number dp graphs number theory shortest paths *2200	0 / 0	(None)
	4477	P1070I Privatization of Roads in Berland flows graph matchings graphs *2400	0 / 0	(None)
	4488	P1076D Edge Deletion graphs greedy shortest paths *1800	0 / 0	(None)
	4507	P1082D Maximum Diameter Graph constructive algorithms graphs implementation *1800	0 / 0	(None)
	4509	P1082G Petya and Graph flows graphs *2400	0 / 0	(None)
	4548	P1093D Beautiful Graph dfs and similar graphs *1700	0 / 0	(None)
	4553	P1095F Make It Connected dsu graphs greedy *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.