	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2557	P1082C Multi-Subject Competition greedy sortings *1600	0 / 0	(无)
	2534	P1088B Ehab and subtraction implementation sortings *1000	0 / 0	(无)
	2499	P1091E New Year and the Acquaintance Estimation binary search data structures graphs greedy implementation math sortings *2400	0 / 0	(无)
	2494	P1092B Teams Forming sortings *800	0 / 0	(无)
	2487	P1093B Letters Rearranging constructive algorithms greedy sortings strings *900	0 / 0	(无)
	2442	P1101C Division and Union sortings *1500	0 / 0	(无)
	2436	P1102B Array K-Coloring greedy sortings *1400	0 / 0	(无)
	2433	P1102E Monotonic Renumeration combinatorics sortings *1700	0 / 0	(无)
	2417	P1106C Lunar New Year and Number Division greedy implementation math sortings *900	0 / 0	(无)
	2411	P1107C Brutality greedy sortings two pointers *1300	0 / 0	(无)
	2408	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	(无)
	2392	P1110B Tape greedy sortings *1400	0 / 0	(无)
	2389	P1110E Magic Stones constructive algorithms math sortings *2200	0 / 0	(无)
	2377	P1114B Yet Another Array Partitioning Task constructive algorithms greedy sortings *1500	0 / 0	(无)
	2352	P1117B Emotes greedy math sortings *1000	0 / 0	(无)
	2337	P1119B Alyona and a Narrow Fridge binary search flows greedy sortings *1300	0 / 0	(无)
	2335	P1119D Frets On Fire binary search sortings *1800	0 / 0	(无)
	2324	P1121A Technogoblet of Fire implementation sortings *1100	0 / 0	(无)
	2318	P1129C Morse Code binary search data structures dp hashing sortings string suffix structures strings *2400	0 / 0	(无)
	2310	P1131C Birthday binary search greedy sortings *1200	0 / 0	(无)
	2304	P1132B Discounts greedy sortings *900	0 / 0	(无)
	2296	P1133C Balanced Team sortings two pointers *1200	0 / 0	(无)
	2294	P1133E K Balanced Teams dp sortings two pointers *1800	0 / 0	(无)
	2289	P1136C Nastya Is Transposing Matrices constructive algorithms sortings *1500	0 / 0	(无)
	2286	P1137A Skyscrapers implementation sortings *1600	0 / 0	(无)
	2270	P1140C Playlist brute force data structures sortings *1600	0 / 0	(无)
	2248	P1144B Parity Alternated Deletions greedy implementation sortings *900	0 / 0	(无)
	2247	P1144C Two Shuffled Sequences constructive algorithms sortings *1000	0 / 0	(无)
	2219	P1148C Crazy Diamond constructive algorithms sortings *1700	0 / 0	(无)
	2218	P1148D Dirty Deeds Done Dirt Cheap greedy sortings *1800	0 / 0	(无)
	2217	P1148E Earth Wind and Fire constructive algorithms greedy math sortings two pointers *2300	0 / 0	(无)
	2203	P1151D Stas and the Queue at the Buffet greedy math sortings *1600	0 / 0	(无)
	2183	P1154E Two Teams data structures implementation sortings *1800	0 / 0	(无)
	2182	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	(无)
	2180	P1155A Reverse a Substring implementation sortings strings *1000	0 / 0	(无)
	2173	P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	(无)
	2172	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	(无)
	2159	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	(无)
	2157	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	(无)
	2139	P1165B Polycarp Training data structures greedy sortings *1000	0 / 0	(无)
	2136	P1165E Two Arrays and Sum of Functions greedy math sortings *1600	0 / 0	(无)
	2131	P1166C A Tale of Two Lands binary search sortings two pointers *1500	0 / 0	(无)
	2122	P1167F Scalar Queries combinatorics data structures math sortings *2300	0 / 0	(无)
	2095	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	(无)
	2094	P1174B Ehab Is an Odd Person sortings *1200	0 / 0	(无)
	2086	P1175D Array Splitting greedy sortings *1900	0 / 0	(无)
	2079	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	(无)
	2077	P1176F Destroy it! dp implementation sortings *2100	0 / 0	(无)
	2055	P1181D Irrigation binary search data structures implementation sortings trees two pointers *2200	0 / 0	(无)
	2054	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	(无)
	2053	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	(无)
	2043	P1183D Candy Box (easy version) greedy sortings *1400	0 / 0	(无)
	2041	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	(无)
	2040	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	(无)
	2035	P1184B1 The Doctor Meets Vader (Easy) binary search sortings *1400	0 / 0	(无)
	2034	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	(无)
	2022	P1185C1 Exam in BerSU (easy version) greedy sortings *1200	0 / 0	(无)
	2007	P1187D Subarray Sorting data structures sortings *2400	0 / 0	(无)
	1996	P1189B Number Circle greedy math sortings *1100	0 / 0	(无)
	1991	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(无)
	1976	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	(无)
	1967	P1195F Geometers Anonymous Club data structures geometry math sortings *2500	0 / 0	(无)
	1954	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(无)
	1955	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(无)
	1952	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	(无)
	1953	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	(无)
	1948	P1197C Array Splitting greedy sortings *1400	0 / 0	(无)
	1949	P1197C Array Splitting greedy sortings *1400	0 / 0	(无)
	1944	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	(无)
	1945	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	(无)
	1940	P1198A MP3 sortings two pointers *1600	0 / 0	(无)
	1941	P1198A MP3 sortings two pointers *1600	0 / 0	(无)
	1938	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	(无)
	1939	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	(无)
	1936	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	(无)
	1937	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	(无)
	1908	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	(无)
	1909	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	(无)
	1881	P1203E Boxers greedy sortings *1500	0 / 0	(无)
	1863	P1206A Choose Two Numbers math sortings *800	0 / 0	(无)
	1842	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	(无)
	1841	P1209E2 Rotate Columns (hard version) bitmasks dp greedy sortings *2500	0 / 0	(无)
	1826	P1211C Ice Cream special problem greedy sortings 1700	0 / 0	(无)
	1815	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	(无)
	1812	P1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	(无)
	1807	P1214E Petya and Construction Set constructive algorithms graphs math sortings trees *2000	0 / 0	(无)
	1806	P1214F Employment greedy sortings *2700	0 / 0	(无)
	1796	P1216B Shooting greedy implementation sortings *900	0 / 0	(无)
	1773	P1220A Cards implementation sortings strings *800	0 / 0	(无)
	1761	P1221F Choose a Square binary search data structures sortings *2400	0 / 0	(无)
	1755	P1223E Paint the Tree dp sortings trees *2100	0 / 0	(无)
	1711	P1237B Balanced Tunnel data structures sortings two pointers *1300	0 / 0	(无)
	1709	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	(无)
	1702	P1238B Kill 'Em All greedy sortings *1300	0 / 0	(无)
	1697	P1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	(无)
	1688	P1242B 0-1 MST dfs and similar dsu graphs sortings *1900	0 / 0	(无)
	1677	P1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	(无)
	1666	P1248B Grow The Tree greedy math sortings *900	0 / 0	(无)
	1658	P1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	(无)
	1638	P1251D Salary Changing binary search greedy sortings *1900	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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