	ID	题目显示标签隐藏标签	AC / 尝试	难度
	241	P1525B Permutation Sort constructive algorithms greedy *900	0 / 0	(无)
	240	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	(无)
	239	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	(无)
	234	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	(无)
	233	P1526C2 Potions (Hard Version) data structures greedy *1600	0 / 0	(无)
	223	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(无)
	221	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	(无)
	217	P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	(无)
	216	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	(无)
	215	P1530A Binary Decimal greedy math *800	0 / 0	(无)
	213	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	(无)
	212	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	(无)
	211	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	(无)
	189	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(无)
	188	P1533F Binary String Partition *special problem binary search greedy	0 / 0	(无)
	182	P1534B Histogram Ugliness greedy implementation math *1100	0 / 0	(无)
	179	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(无)
	178	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(无)
	177	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(无)
	173	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	(无)
	172	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	(无)
	170	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	(无)
	165	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	(无)
	162	P1537A Arithmetic Array greedy math *800	0 / 0	(无)
	161	P1537B Bad Boy constructive algorithms greedy math *900	0 / 0	(无)
	160	P1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	(无)
	158	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(无)
	157	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	(无)
	156	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(无)
	155	P1538A Stone Game brute force dp greedy *800	0 / 0	(无)
	154	P1538B Friends and Candies greedy math *800	0 / 0	(无)
	149	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	(无)
	148	P1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	(无)
	146	P1539C Stable Groups greedy sortings *1200	0 / 0	(无)
	145	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	(无)
	144	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(无)
	143	P1539F Strange Array data structures greedy sortings *2600	0 / 0	(无)
	142	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(无)
	136	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	(无)
	128	P1543A Exciting Bets greedy math number theory *900	0 / 0	(无)
	127	P1543B Customising the Track combinatorics greedy math *900	0 / 0	(无)
	123	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(无)
	115	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(无)
	112	P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	(无)
	111	P1547C Pair Programming greedy two pointers *1100	0 / 0	(无)
	110	P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	(无)
	100	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	(无)
	95	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(无)
	1875	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(无)
	92	P1550A Find The Array greedy math *800	0 / 0	(无)
	91	P1550B Maximum Cost Deletion greedy math *1000	0 / 0	(无)
	90	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(无)
	86	P1551A Polycarp and Coins greedy math *800	0 / 0	(无)
	85	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(无)
	84	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(无)
	83	P1551C Interesting Story greedy sortings strings *1500	0 / 0	(无)
	77	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	(无)
	76	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(无)
	74	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(无)
	67	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(无)
	66	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	(无)
	60	P1554A Cherry greedy *800	0 / 0	(无)
	59	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	(无)
	58	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(无)
	57	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	(无)
	45	P1556E Equilibrium data structures dp greedy *2200	0 / 0	(无)
	42	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	(无)
	40	P1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	(无)
	38	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(无)
	34	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(无)
	32	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(无)
	29	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	(无)
	26	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(无)
	27	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(无)
	20	P1560D Make a Power of Two greedy math strings *1300	0 / 0	(无)
	18	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(无)
	17	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(无)
	15	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(无)
	13	P1562A The Miracle and the Sleeper greedy math *800	0 / 0	(无)
	8	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(无)
	7226	P1566A Median Maximization greedy math	0 / 0	(无)
	7224	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy	0 / 0	(无)
	7223	P1566D1 Seating Arrangements (easy version) greedy sortings	0 / 0	(无)
	7222	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings	0 / 0	(无)
	7221	P1566E Buds Re-hanging dfs and similar dp graphs greedy trees	0 / 0	(无)
	7219	P1566G Four Vertices constructive algorithms graphs greedy implementation shortest paths	0 / 0	(无)
	5	P1567B MEXor Mixup bitmasks greedy	0 / 0	(无)
	3	P1567D Expression Evaluation Error constructive algorithms data structures greedy implementation math	0 / 0	(无)
	7296	P1570C Shooting *special problem greedy implementation	0 / 0	(无)
	7304	P1571E Fix the String *special problem bitmasks dp greedy	0 / 0	(无)
	7232	P1572C Paint dp greedy *2700	0 / 0	(无)
	7231	P1572D Bridge Club flows graphs greedy *2800	0 / 0	(无)
	7228	P1573A Countdown greedy *800	0 / 0	(无)
	7227	P1573B Swaps greedy math *1400	0 / 0	(无)
	7239	P1574B Combinatorics Homework combinatorics greedy math	0 / 0	(无)
	7238	P1574C Slay the Dragon binary search greedy sortings	0 / 0	(无)
	7237	P1574D The Strongest Build binary search data structures dfs and similar graphs greedy hashing implementation shortest paths	0 / 0	(无)
	7258	P1578L Labyrinth binary search dsu greedy *2400	0 / 0	(无)
	7246	P1579C Ticks greedy implementation *1500	0 / 0	(无)
	7245	P1579D Productive Meeting graphs greedy *1400	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

杨旭龙、王树淳、王国斌、宋文宇、朱天伦

特别鸣谢

肖飞、关玉蓉、魏银珍、周芬

Worker 0, 149ms
Powered by Hydro v4.13.4
Modified by HGNU ACM TEAM (Repo Link)