题库 - sortings - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	344	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	342	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	336	P1487A Arena implementation sortings *800	1 / 1	3
	332	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	314	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	295	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	1 / 1	7
	289	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	286	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	4
	278	P1497A Meximization brute force data structures greedy sortings *800	1 / 1	3
	267	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	255	P1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	10
	251	P1501B Napoleon Cake dp implementation sortings *900	1 / 1	3
	248	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	247	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	10
	228	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	223	P1508D Swap Pass constructive algorithms geometry sortings *3000	0 / 0	10
	222	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	10
	186	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	187	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	188	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	185	P1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	8
	183	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	9
	184	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	9
	172	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	173	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	171	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	164	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	165	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	166	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	152	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	153	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	154	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	149	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	150	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	151	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	128	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	129	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	130	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	110	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	111	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	107	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	10
	108	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	10
	75	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	71	P1526A Mean Inequality constructive algorithms sortings *800	1 / 1	3
	51	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	3
	8477	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	7124	P1532D Teams Forming *special problem sortings	0 / 0	(无)
	35	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	10
	34	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	32	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3

根据当前过滤条件随机选择一道题