	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2233	P1146C Tree Diameter bitmasks graphs interactive *1700	0 / 0	(无)
	2229	P1146G Zoning Restrictions dp flows graphs *2700	0 / 0	(无)
	2227	P1147A Hide and Seek graphs *1500	0 / 0	(无)
	2224	P1147D Palindrome XOR dfs and similar graphs *2400	0 / 0	(无)
	2215	P1148G Gold Experience constructive algorithms graphs math number theory probabilities *3300	0 / 0	(无)
	2210	P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	(无)
	2209	P1149E Election Promises games graphs *3200	0 / 0	(无)
	2196	P1152E Neko and Flashback constructive algorithms dfs and similar graphs *2400	0 / 0	(无)
	2175	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	(无)
	2168	P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	(无)
	2157	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	(无)
	2142	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	(无)
	2141	P1163F Indecisive Taxi Fee data structures graphs shortest paths *3000	0 / 0	(无)
	2128	P1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	(无)
	2125	P1167C News Distribution dfs and similar dsu graphs *1400	0 / 0	(无)
	2114	P1169B Pairs graphs implementation *1500	0 / 0	(无)
	2107	P1170G Graph Decomposition *special problem graphs	0 / 0	(无)
	2090	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(无)
	2079	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	(无)
	2078	P1176E Cover it! dfs and similar dsu graphs shortest paths trees *1700	0 / 0	(无)
	2066	P1178H Stock Exchange binary search flows graphs *3500	0 / 0	(无)
	2042	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	(无)
	2034	P1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	(无)
	2027	P1184E1 Daleks' Invasion (easy) graphs trees *1900	0 / 0	(无)
	2026	P1184E2 Daleks' Invasion (medium) dfs and similar graphs shortest paths trees *2100	0 / 0	(无)
	2025	P1184E3 Daleks' Invasion (hard) data structures dsu graphs trees *2400	0 / 0	(无)
	2011	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	(无)
	2004	P1187G Gang Up flows graphs *2500	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	(无)
	1932	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	(无)
	1933	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	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	(无)
	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	(无)
	1874	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	(无)
	1868	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	(无)
	1843	P1209D Cow and Snacks dfs and similar dsu graphs *1700	0 / 0	(无)
	1840	P1209F Koala and Notebook data structures dfs and similar graphs shortest paths strings trees *2600	0 / 0	(无)
	1836	P1210A Anadi and Domino brute force graphs *1700	0 / 0	(无)
	1833	P1210D Konrad and Company Evaluation graphs *2400	0 / 0	(无)
	1823	P1211F kotlinkotlinkotlinkotlin... special problem graphs implementation strings 2300	0 / 0	(无)
	1820	P1211I Unusual Graph special problem graphs 3000	0 / 0	(无)
	1813	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	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	(无)
	1787	P1217D Coloring Edges constructive algorithms dfs and similar graphs *2100	0 / 0	(无)
	1785	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	(无)
	1784	P1218A BubbleReactor dp graphs *2800	0 / 0	(无)
	1781	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	(无)
	1778	P1218G Alpha planetary system constructive algorithms graphs shortest paths *3000	0 / 0	(无)
	1769	P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	(无)
	1739	P1227E Arson In Berland Forest binary search graphs graphs shortest paths *2200	0 / 0	(无)
	1732	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	(无)
	1713	P1236F Alice and the Cactus dfs and similar graphs math probabilities *3000	0 / 0	(无)
	1698	P1238F The Maximum Subtree dfs and similar dp graphs trees *2200	0 / 0	(无)
	1693	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	(无)
	1691	P1239F Swiper, no swiping! graphs implementation *3400	0 / 0	(无)
	1690	P1240F Football graphs *3100	0 / 0	(无)
	1688	P1242B 0-1 MST dfs and similar dsu graphs sortings *1900	0 / 0	(无)
	1687	P1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	(无)
	1685	P1242E Planar Perimeter constructive algorithms graphs *3200	0 / 0	(无)
	1678	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(无)
	1671	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	(无)
	1651	P1250E The Coronation graphs implementation *2300	0 / 0	(无)
	1645	P1250K Projectors flows graphs *3100	0 / 0	(无)
	1642	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	(无)
	1623	P1252L Road Construction flows graphs *2300	0 / 0	(无)
	1619	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	(无)
	1617	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	(无)
	1609	P1255B Fridge Lockers graphs implementation *1100	0 / 0	(无)
	1584	P1263D Secret Passwords dfs and similar dsu graphs *1500	0 / 0	(无)
	1582	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	(无)
	1568	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	(无)
	1566	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	(无)
	1564	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(无)
	1548	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(无)
	1538	P1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	(无)
	1525	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	(无)
	1514	P1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	(无)
	1503	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	(无)
	1492	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	(无)
	1481	P1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	(无)
	1477	P1283D Christmas Trees graphs greedy shortest paths *1800	0 / 0	(无)
	1469	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	(无)
	1468	P1284G Seollal graphs *3300	0 / 0	(无)
	1463	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(无)
	1460	P1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	(无)
	1444	P1290C Prefix Enlightenment dfs and similar dsu graphs *2400	0 / 0	(无)
	1443	P1290D Coffee Varieties (hard version) constructive algorithms graphs interactive *3000	0 / 0	(无)
	1438	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	(无)
	1434	P1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	(无)
	1413	P1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	(无)
	1398	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	(无)
	1391	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	(无)
	1389	P1301F Super Jaber dfs and similar graphs implementation shortest paths *2600	0 / 0	(无)
	1368	P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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