graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2441	P1178H Stock Exchange binary search flows graphs *3500	0 / 0	(None)
	2417	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	(None)
	2409	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	(None)
	2402	P1184E1 Daleks' Invasion (easy) graphs trees *1900	0 / 0	(None)
	2401	P1184E2 Daleks' Invasion (medium) dfs and similar graphs shortest paths trees *2100	0 / 0	(None)
	2400	P1184E3 Daleks' Invasion (hard) data structures dsu graphs trees *2400	0 / 0	(None)
	2386	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	(None)
	2379	P1187G Gang Up flows graphs *2500	0 / 0	(None)
	2326	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	(None)
	2324	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	(None)
	2315	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(None)
	2310	P1201E1 Knightmare (easy) graphs interactive shortest paths *2900	0 / 0	(None)
	2309	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	(None)
	2292	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	(None)
	2287	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	(None)
	2262	P1209D Cow and Snacks dfs and similar dsu graphs *1700	0 / 0	(None)
	2259	P1209F Koala and Notebook data structures dfs and similar graphs shortest paths strings trees *2600	0 / 0	(None)
	2255	P1210A Anadi and Domino brute force graphs *1700	0 / 0	(None)
	2252	P1210D Konrad and Company Evaluation graphs *2400	0 / 0	(None)
	2242	P1211F kotlinkotlinkotlinkotlin... special problem graphs implementation strings 2300	0 / 0	(None)

Pick a problem randomly based on the current filter.