data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8081	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	8174	P1777F Comfortably Numb binary search bitmasks data structures divide and conquer dsu strings trees two pointers	0 / 0	(None)
	8110	P1779C Least Prefix Sum data structures greedy	0 / 0	(None)
	8109	P1779D Boris and His Amazing Haircut constructive algorithms data structures dp dsu greedy sortings	0 / 0	(None)
	8222	P1780E Josuke and Complete Graph binary search brute force data structures math number theory	0 / 0	(None)
	8221	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings	0 / 0	(None)
	8169	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	8098	P1783G Weighed Tree Radius data structures divide and conquer implementation trees	0 / 0	(None)
	8217	P1784C Monsters (hard version) binary search data structures greedy	0 / 0	(None)
	8204	P1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	10
	8203	P1787H Codeforces Scoreboard binary search data structures dp geometry *3300	0 / 0	10
	8202	P1787I Treasure Hunt data structures divide and conquer two pointers *3400	0 / 0	10
	8246	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	8198	P1790D Matryoshkas data structures greedy sortings *1200	0 / 0	4
	8189	P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	5
	8183	P1792D Fixed Prefix Permutations binary search bitmasks data structures hashing math sortings *1700	0 / 0	5
	8242	P1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	4
	8240	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	8239	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	8275	P1794E Labeling the Tree with Distances data structures dp hashing implementation trees	0 / 0	(None)

Pick a problem randomly based on the current filter.