	ID	题目显示标签隐藏标签	AC / 尝试	难度
	194	P1532F Prefixes and Suffixes *special problem strings	0 / 0	(无)
	193	P1533A Travel to Bertown *special problem implementation math	0 / 0	(无)
	192	P1533B Nearest Point Function *special problem implementation	0 / 0	(无)
	191	P1533C Sweets *special problem data structures implementation	0 / 0	(无)
	190	P1533D String Searching *special problem hashing	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	(无)
	187	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(无)
	186	P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(无)
	185	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(无)
	184	P1533J Pawns *special problem	0 / 0	(无)
	183	P1534A Colour the Flag brute force implementation *800	0 / 0	(无)
	182	P1534B Histogram Ugliness greedy implementation math *1100	0 / 0	(无)
	181	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(无)
	180	P1534D Lost Tree constructive algorithms interactive trees *1800	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	(无)
	176	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	(无)
	175	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(无)
	174	P1535A Fair Playoff brute force implementation *800	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	(无)
	171	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(无)
	170	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	(无)
	169	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	(无)
	168	P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	(无)
	167	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	(无)
	166	P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	(无)
	165	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	(无)
	164	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	(无)
	163	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	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	(无)
	159	P1537D Deleting Divisors games math number theory *1700	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	(无)
	153	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	(无)
	152	P1538D Another Problem About Dividing Numbers constructive algorithms math number theory *1700	0 / 0	(无)
	151	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	(无)
	150	P1538F Interesting Function binary search dp math number theory *1500	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	(无)
	147	P1539B Love Song dp implementation strings *800	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	(无)
	141	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(无)
	140	P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	(无)
	139	P1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	(无)
	138	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(无)
	137	P1540E Tasty Dishes math matrices *3500	0 / 0	(无)
	136	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	(无)
	135	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	(无)
	134	P1542A Odd Set math *800	0 / 0	(无)
	133	P1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	(无)
	132	P1542C Strange Function math number theory *1600	0 / 0	(无)
	131	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	(无)
	130	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	(无)
	129	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	(无)
	128	P1543A Exciting Bets greedy math number theory *900	0 / 0	(无)
	127	P1543B Customising the Track combinatorics greedy math *900	0 / 0	(无)
	126	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(无)
	125	P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	(无)
	124	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	(无)
	123	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(无)
	122	P1545A AquaMoon and Strange Sort sortings *1500	0 / 0	(无)
	121	P1545B AquaMoon and Chess combinatorics math *1900	0 / 0	(无)
	120	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(无)
	119	P1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	(无)
	118	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	(无)
	117	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	(无)
	116	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(无)
	115	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(无)
	114	P1546B AquaMoon and Stolen String interactive math *1200	0 / 0	(无)
	113	P1547A Shortest Path with Obstacle implementation math *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	(无)
	109	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(无)
	108	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(无)
	1878	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(无)
	100	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	(无)
	99	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(无)
	98	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(无)
	97	P1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	(无)
	96	P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	(无)
	95	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(无)
	94	P1549A Gregor and Cryptography math number theory *800	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	(无)
	89	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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