graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3728	P748F Santa Clauses and a Soccer Championship constructive algorithms dfs and similar graphs trees *2300	0 / 0	(None)
	3743	P755C PolandBall and Forest dfs and similar dsu graphs interactive trees *1300	0 / 0	(None)
	3744	P755E PolandBall and White-Red graph constructive algorithms graphs shortest paths *2400	0 / 0	(None)
	3752	P757F Team Rocket Rises Again data structures graphs shortest paths *2800	0 / 0	(None)
	3765	P763A Timofey and a tree dfs and similar dp dsu graphs implementation trees *1600	0 / 0	(None)
	3777	P766D Mahmoud and a Dictionary data structures dfs and similar dp dsu graphs *2000	0 / 0	(None)
	3780	P767C Garland dfs and similar graphs greedy trees *2000	0 / 0	(None)
	3790	P770C Online Courses In BSU special problem dfs and similar graphs implementation 1500	0 / 0	(None)
	3800	P773D Perishable Roads dp graphs shortest paths *2700	0 / 0	(None)
	3811	P776D The Door Problem 2-sat dfs and similar dsu graphs *2000	0 / 0	(None)
	3812	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	(None)
	3823	P780D Innokenty and a Football League 2-sat graphs greedy implementation shortest paths strings *1900	0 / 0	(None)
	3824	P780F Axel and Marston in Bitland bitmasks dp graphs matrices *2400	0 / 0	(None)
	3834	P786E ALT data structures flows graphs trees *3200	0 / 0	(None)
	3836	P788B Weird journey combinatorics constructive algorithms dfs and similar dsu graphs *2100	0 / 0	(None)
	3837	P788C The Great Mixing dfs and similar graphs shortest paths *2300	0 / 0	(None)
	3846	P793D Presents in Bankopolis dp graphs shortest paths *2100	0 / 0	(None)
	3850	P794D Labelling Cities dfs and similar graphs hashing *2400	0 / 0	(None)
	3854	P796D Police Stations constructive algorithms dfs and similar dp graphs shortest paths trees *2100	0 / 0	(None)
	3862	P798E Mike and code of a permutation constructive algorithms data structures graphs sortings *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.