graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6030	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(None)
	6037	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	6040	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	6055	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
	6059	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	6069	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	6077	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	6086	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	(None)
	6093	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	(None)
	6097	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	(None)
	6099	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	(None)
	6103	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	(None)
	6105	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	(None)
	6114	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
	6120	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)
	6125	P1585G Poachers dp games graphs trees *2500	0 / 0	(None)
	6126	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	(None)
	6136	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
	6148	P1599I Desert data structures graphs *2700	0 / 0	(None)
	6152	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.