dsu - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5638	P1434E A Convex Game dsu games *3500	0 / 0	(None)
	5656	P1442B Identify the Operations combinatorics data structures dsu greedy implementation *1800	0 / 0	(None)
	5717	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	(None)
	5729	P1468J Road Reform dsu graphs greedy *1800	0 / 0	(None)
	5758	P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	(None)
	5878	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(None)
	5885	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
	5907	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
	5952	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(None)
	5969	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
	6006	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	6027	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(None)
	6031	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	(None)
	6040	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	6059	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	6077	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	6083	P1575J Jeopardy of Dropped Balls binary search brute force dsu implementation *1500	0 / 0	(None)
	6087	P1578B Building Forest Trails data structures dsu *2800	0 / 0	(None)
	6127	P1592B Hemose Shopping constructive algorithms dsu math sortings *1200	0 / 0	(None)
	6136	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.