	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1997	P1189A Keanu Reeves strings *800	0 / 0	(无)
	1996	P1189B Number Circle greedy math sortings *1100	0 / 0	(无)
	1995	P1189C Candies! data structures dp implementation math *1400	0 / 0	(无)
	1994	P1190A Tokitsukaze and Discard Items implementation two pointers *1400	0 / 0	(无)
	1993	P1190B Tokitsukaze, CSL and Stone Game games *1800	0 / 0	(无)
	1992	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	(无)
	1991	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(无)
	1990	P1190E Tokitsukaze and Explosion binary search greedy *3100	0 / 0	(无)
	1989	P1190F Tokitsukaze and Powers number theory probabilities *3400	0 / 0	(无)
	1988	P1191A Tokitsukaze and Enhancement brute force *800	0 / 0	(无)
	1987	P1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	(无)
	1986	P1192A Building Skyscrapers *special problem	0 / 0	(无)
	1985	P1192B Dynamic Diameter *special problem data structures dfs and similar divide and conquer trees	0 / 0	(无)
	1984	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
	1983	P1193A Amusement Park *special problem dp math	0 / 0	(无)
	1982	P1193B Magic Tree *special problem data structures dp trees	0 / 0	(无)
	1981	P1193C Scissors and Tape *special problem constructive algorithms geometry	0 / 0	(无)
	1980	P1194A Remove a Progression math *800	0 / 0	(无)
	1979	P1194B Yet Another Crosses Problem implementation *1300	0 / 0	(无)
	1978	P1194C From S To T implementation strings *1300	0 / 0	(无)
	1977	P1194D 1-2-K Game games math *1700	0 / 0	(无)
	1976	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	(无)
	1975	P1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	0 / 0	(无)
	1974	P1194G Another Meme Problem dp *2700	0 / 0	(无)
	1973	P1195A Drinks Choosing greedy math *1000	0 / 0	(无)
	1972	P1195B Sport Mafia binary search brute force math *1000	0 / 0	(无)
	1971	P1195C Basketball Exercise dp *1400	0 / 0	(无)
	1970	P1195D1 Submarine in the Rybinsk Sea (easy edition) combinatorics math number theory *1500	0 / 0	(无)
	1969	P1195D2 Submarine in the Rybinsk Sea (hard edition) combinatorics math number theory *1800	0 / 0	(无)
	1968	P1195E OpenStreetMap data structures two pointers *2100	0 / 0	(无)
	1967	P1195F Geometers Anonymous Club data structures geometry math sortings *2500	0 / 0	(无)
	1966	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	(无)
	1964	P1196B Odd Sum Segments constructive algorithms math *1200	0 / 0	(无)
	1965	P1196B Odd Sum Segments constructive algorithms math *1200	0 / 0	(无)
	1962	P1196C Robot Breakout implementation *1500	0 / 0	(无)
	1963	P1196C Robot Breakout implementation *1500	0 / 0	(无)
	1960	P1196D1 RGB Substring (easy version) implementation *1500	0 / 0	(无)
	1961	P1196D1 RGB Substring (easy version) implementation *1500	0 / 0	(无)
	1958	P1196D2 RGB Substring (hard version) data structures dp implementation two pointers *1600	0 / 0	(无)
	1959	P1196D2 RGB Substring (hard version) data structures dp implementation two pointers *1600	0 / 0	(无)
	1956	P1196E Connected Component on a Chessboard constructive algorithms implementation *1800	0 / 0	(无)
	1957	P1196E Connected Component on a Chessboard constructive algorithms implementation *1800	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	(无)
	1950	P1197B Pillars greedy implementation *1000	0 / 0	(无)
	1951	P1197B Pillars greedy implementation *1000	0 / 0	(无)
	1948	P1197C Array Splitting greedy sortings *1400	0 / 0	(无)
	1949	P1197C Array Splitting greedy sortings *1400	0 / 0	(无)
	1946	P1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	(无)
	1947	P1197D Yet Another Subarray Problem dp greedy math *1900	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	(无)
	1942	P1197F Coloring Game dp games matrices *2700	0 / 0	(无)
	1943	P1197F Coloring Game dp games matrices *2700	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	(无)
	1934	P1198D Rectangle Painting 1 dp *2300	0 / 0	(无)
	1935	P1198D Rectangle Painting 1 dp *2300	0 / 0	(无)
	1932	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	(无)
	1933	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	(无)
	1930	P1198F GCD Groups 2 greedy number theory probabilities *2900	0 / 0	(无)
	1931	P1198F GCD Groups 2 greedy number theory probabilities *2900	0 / 0	(无)
	1928	P1199A City Day implementation *1000	0 / 0	(无)
	1929	P1199A City Day implementation *1000	0 / 0	(无)
	1926	P1199B Water Lily geometry math *1000	0 / 0	(无)
	1927	P1199B Water Lily geometry math *1000	0 / 0	(无)
	1924	P1200A Hotelier brute force data structures implementation *800	0 / 0	(无)
	1925	P1200A Hotelier brute force data structures implementation *800	0 / 0	(无)
	1922	P1200B Block Adventure dp greedy *1200	0 / 0	(无)
	1923	P1200B Block Adventure dp greedy *1200	0 / 0	(无)
	1920	P1200C Round Corridor math number theory *1400	0 / 0	(无)
	1921	P1200C Round Corridor math number theory *1400	0 / 0	(无)
	1918	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(无)
	1919	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(无)
	1916	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(无)
	1917	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(无)
	1914	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(无)
	1915	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(无)
	1912	P1201A Important Exam implementation strings *900	0 / 0	(无)
	1913	P1201A Important Exam implementation strings *900	0 / 0	(无)
	1910	P1201B Zero Array greedy math *1500	0 / 0	(无)
	1911	P1201B Zero Array greedy math *1500	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	(无)
	1906	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	(无)
	1907	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	(无)
	1904	P1201E1 Knightmare (easy) graphs interactive shortest paths *2900	0 / 0	(无)
	1905	P1201E1 Knightmare (easy) graphs interactive shortest paths *2900	0 / 0	(无)
	1902	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	(无)
	1903	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	(无)
	1900	P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	(无)
	1901	P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	(无)
	1898	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	(无)
	1899	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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