data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6230	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	(None)
	6232	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
	6239	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	(None)
	6240	P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	(None)
	6254	P1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	(None)
	6255	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	(None)
	6262	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	(None)
	6266	P1628E Groceries in Meteor Town binary search data structures dsu trees *3100	0 / 0	(None)
	6267	P1628F Spaceship Crisis Management binary search data structures geometry sortings *3500	0 / 0	(None)
	6276	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(None)
	6277	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
	6281	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
	6282	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
	6285	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	(None)
	6289	P1635F Closest Pair data structures greedy *2800	0 / 0	(None)
	6294	P1637H Minimize Inversions Number data structures greedy math sortings *3500	0 / 0	(None)
	6295	P1638B Odd Swap Sort data structures math sortings *1100	5 / 15	8
	6296	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	(None)
	6297	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	(None)
	6311	P1644D Cross Coloring data structures implementation math *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.