	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1358	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	(无)
	1353	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	(无)
	1350	P1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	(无)
	1346	P1310D Tourism dp graphs probabilities *2300	0 / 0	(无)
	1318	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	(无)
	1314	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	(无)
	1305	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	(无)
	1294	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(无)
	1289	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	(无)
	1288	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	(无)
	1277	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	(无)
	1275	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	(无)
	1268	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	(无)
	1267	P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	(无)
	1240	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	(无)
	1234	P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	(无)
	1233	P1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	(无)
	1224	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	(无)
	1217	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(无)
	1210	P1338E JYPnation graphs *3500	0 / 0	(无)
	1206	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	(无)
	1205	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	(无)
	1204	P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	(无)
	1203	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	(无)
	1189	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	(无)
	1186	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	(无)
	1185	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	(无)
	1176	P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	(无)
	1175	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	(无)
	1165	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	(无)
	1162	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	(无)
	1134	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	(无)
	1081	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(无)
	1077	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(无)
	1075	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(无)
	1073	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(无)
	1059	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(无)
	1054	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(无)
	1045	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(无)
	1039	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(无)
	1032	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(无)
	1030	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(无)
	1024	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(无)
	1016	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(无)
	1015	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(无)
	981	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(无)
	956	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(无)
	954	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(无)
	953	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(无)
	951	P1383F Special Edges flows graphs *3200	0 / 0	(无)
	943	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(无)
	941	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(无)
	930	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	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	(无)
	917	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(无)
	908	P1392I Kevin and Grid fft graphs math *3300	0 / 0	(无)
	900	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(无)
	873	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(无)
	857	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(无)
	856	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	(无)
	855	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(无)
	849	P1404E Bricks flows graph matchings graphs *2800	0 / 0	(无)
	844	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	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	(无)
	832	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(无)
	830	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(无)
	819	P1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	(无)
	799	P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	(无)
	792	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	(无)
	781	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(无)
	766	P1422D Returning Home graphs shortest paths sortings *2300	0 / 0	(无)
	762	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	(无)
	761	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(无)
	756	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(无)
	748	P1424M Ancient Language graphs sortings *2200	0 / 0	(无)
	727	P1427G One Billion Shades of Grey flows graphs *3300	0 / 0	(无)
	724	P1428B Belted Rooms graphs implementation *1200	0 / 0	(无)
	710	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	(无)
	693	P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	(无)
	688	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	(无)
	682	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	(无)
	671	P1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	(无)
	670	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	(无)
	662	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	(无)
	652	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	(无)
	633	P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	(无)
	604	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	(无)
	591	P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	(无)
	582	P1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	(无)
	569	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	(无)
	561	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	(无)
	559	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	(无)
	543	P1468J Road Reform dsu graphs greedy *1800	0 / 0	(无)
	540	P1468M Similar Sets data structures graphs implementation *2300	0 / 0	(无)
	531	P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	(无)
	529	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	(无)
	528	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	(无)
	522	P1472C Long Jumps dp graphs *1100	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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