graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5394	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
	5412	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
	5416	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
	5421	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
	5427	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
	5434	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
	5456	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	5471	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
	5472	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
	5473	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
	5474	P1383F Special Edges flows graphs *3200	0 / 0	(None)
	5480	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(None)
	5481	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
	5489	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
	5495	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(None)
	5507	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)
	5537	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	(None)
	5538	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
	5542	P1404E Bricks flows graph matchings graphs *2800	0 / 0	(None)
	5545	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.