data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5225	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	(None)
	5239	P1312G Autocompletion data structures dfs and similar dp *2600	0 / 0	(None)
	5241	P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	(None)
	5248	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	(None)
	5250	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	(None)
	5251	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	(None)
	5255	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	(None)
	5260	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	(None)
	5269	P1326E Bombs data structures two pointers *2400	0 / 0	(None)
	5274	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)
	5280	P1329C Drazil Likes Heap constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
	5291	P1332G No Monotone Triples data structures *3100	0 / 0	(None)
	5293	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	(None)
	5298	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	(None)
	5302	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	5303	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	5316	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	(None)
	5320	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
	5328	P1344E Train Tracks data structures trees *3100	0 / 0	(None)
	5334	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	(None)

Pick a problem randomly based on the current filter.