	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1141	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(无)
	1140	P1353F Decreasing Heights brute force dp *2200	0 / 0	(无)
	1138	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	(无)
	1134	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	(无)
	1133	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(无)
	1130	P1355B Young Explorers dp greedy sortings *1200	0 / 0	(无)
	1090	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(无)
	1088	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(无)
	1081	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(无)
	1080	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(无)
	1064	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(无)
	1063	P1363F Rotating Substrings dp strings *2600	0 / 0	(无)
	1046	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(无)
	1045	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(无)
	1044	P1366G Construct the String data structures dp strings *2700	0 / 0	(无)
	1039	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(无)
	1038	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(无)
	1037	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(无)
	1029	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(无)
	1024	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(无)
	1022	P1369F BareLee dfs and similar dp games *2700	0 / 0	(无)
	1018	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(无)
	1009	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(无)
	1004	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(无)
	1003	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(无)
	998	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(无)
	997	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(无)
	976	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(无)
	974	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(无)
	969	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(无)
	966	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(无)
	962	P1381B Unmerge dp *1800	0 / 0	(无)
	960	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(无)
	957	P1382B Sequential Nim dp games *1100	0 / 0	(无)
	955	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(无)
	954	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(无)
	952	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(无)
	949	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(无)
	948	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(无)
	944	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(无)
	937	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(无)
	936	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(无)
	934	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	(无)
	927	P1389B Array Walk brute force dp greedy *1600	0 / 0	(无)
	926	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(无)
	923	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(无)
	922	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(无)
	919	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(无)
	918	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(无)
	913	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(无)
	910	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(无)
	909	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(无)
	904	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(无)
	903	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(无)
	902	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(无)
	901	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(无)
	898	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(无)
	894	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	(无)
	891	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	(无)
	884	P1398C Good Subarrays data structures dp math *1600	0 / 0	(无)
	883	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(无)
	881	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(无)
	873	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(无)
	868	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(无)
	867	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(无)
	866	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	(无)
	862	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(无)
	857	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(无)
	854	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	(无)
	852	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(无)
	845	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	(无)
	838	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	(无)
	837	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(无)
	834	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	(无)
	833	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(无)
	830	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(无)
	828	P1408I Bitwise Magic dp math *3200	0 / 0	(无)
	823	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(无)
	822	P1409F Subsequences of Length Two dp strings *2100	0 / 0	(无)
	812	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(无)
	806	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	(无)
	803	P1415F Cakes for Clones dp *2900	0 / 0	(无)
	800	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(无)
	798	P1416E Split binary search data structures dp greedy *3200	0 / 0	(无)
	792	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	(无)
	778	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	(无)
	777	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(无)
	775	P1420E Battle Lemmings dp greedy *2500	0 / 0	(无)
	770	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	(无)
	767	P1422C Bargain combinatorics dp math *1700	0 / 0	(无)
	765	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	(无)
	754	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	(无)
	746	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	(无)
	744	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	(无)
	734	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	(无)
	731	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	(无)
	720	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(无)
	719	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	(无)
	718	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	(无)
	711	P1430F Realistic Gameplay dp greedy *2600	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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