dsu - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8263	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math	0 / 0	(None)
	8254	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8253	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8290	P1801E Gasoline prices data structures divide and conquer dsu trees	0 / 0	(None)
	8296	P1804G Flow Control data structures dsu implementation	0 / 0	(None)
	8359	P1805D A Wide, Wide Graph dfs and similar dp dsu greedy trees	0 / 0	(None)
	8358	P1805E There Should Be a Lot of Maximums data structures dfs and similar dsu graphs trees two pointers	0 / 0	(None)
	8306	P1806D DSU Master combinatorics dp dsu math	0 / 0	(None)
	8344	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy implementation *2100	0 / 0	7
	8363	P1814F Communication Towers brute force divide and conquer dsu	0 / 0	(None)
	8495	P1824C LuoTianyi and XOR-Tree data structures dfs and similar dp dsu greedy trees *2500	0 / 0	9
	8489	P1827B1 Range Sorting (Easy Version) binary search dp dsu greedy trees two pointers *2000	0 / 0	7
	8402	P1829E The Lakes dfs and similar dsu graphs implementation	0 / 0	(None)
	8468	P1833E Round Dance dfs and similar dsu graphs shortest paths *1600	0 / 0	5
	8466	P1833G Ksyusha and Chinchilla constructive algorithms dfs and similar dp dsu greedy implementation trees *1800	0 / 0	6
	8529	P1844E Great Grids constructive algorithms dfs and similar dsu graphs math	0 / 0	(None)
	8525	P1844H Multiple of Three Cycles combinatorics dp dsu math	0 / 0	(None)
	8521	P1845D Rating System binary search brute force data structures dp dsu greedy math two pointers *1800	0 / 0	6
	8507	P1847D Professor Higashikata data structures dsu greedy implementation strings	0 / 0	(None)
	8632	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers *2300	0 / 0	8

Pick a problem randomly based on the current filter.