graphs - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
1494	P1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	6
1489	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	9
1488	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
1476	P1627F Not Splitting geometry graphs greedy implementation shortest paths *2700	0 / 0	10
1461	P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	10
1454	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	9
1448	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	9
1442	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	9
1436	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
1424	P1638C Inversion Graph data structures dsu graphs math *1300	0 / 0	4
1420	P1639A Treasure Hunt graphs interactive	0 / 0	(无)
1419	P1639B Treasure Hunt graphs interactive	0 / 0	(无)
1418	P1639C Treasure Hunt graphs interactive	0 / 0	(无)
1417	P1639D Treasure Hunt graphs interactive	0 / 0	(无)
1416	P1639E Treasure Hunt graphs interactive	0 / 0	(无)
1415	P1639F Treasure Hunt graphs interactive	0 / 0	(无)
1414	P1639G Treasure Hunt graphs interactive	0 / 0	(无)
1413	P1639H Treasure Hunt graphs interactive	0 / 0	(无)
1412	P1639I Treasure Hunt graphs interactive	0 / 0	(无)
1411	P1639J Treasure Hunt graphs interactive	0 / 0	(无)
1410	P1639K Treasure Hunt graphs interactive	0 / 0	(无)
1388	P1647B Madoka and the Elegant Gift brute force constructive algorithms graphs implementation *1200	0 / 0	4
1379	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	10
1378	P1648F Two Avenues data structures dfs and similar graphs *3500	0 / 0	10
1369	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
1365	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths *1900	0 / 0	6
1358	P1654E Arithmetic Operations brute force data structures graphs math *2300	0 / 0	8
1356	P1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	10
1349	P1656F Parametric MST binary search constructive algorithms graphs greedy math sortings *2600	0 / 0	10
1348	P1656G Cycle Palindrome constructive algorithms graphs math *3200	0 / 0	10
1346	P1656I Neighbour Ordering constructive algorithms graphs *3500	0 / 0	10
1340	P1657F Words on Tree 2-sat dfs and similar dsu graphs trees *2600	0 / 0	10
1328	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
1327	P1659F Tree and Permutation Game dfs and similar games graphs trees *3000	0 / 0	10
1318	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
1311	P1662C European Trip dp graphs math matrices	0 / 0	(无)
1308	P1662F Antennas data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths	0 / 0	(无)
1304	P1662J Training Camp flows graphs	0 / 0	(无)
1299	P1662O Circular Maze brute force dfs and similar graphs implementation	0 / 0	(无)
1274	P1666L Labyrinth dfs and similar graphs *1800	0 / 0	6
1255	P1670C Where is the Pizza? data structures dfs and similar dsu graphs implementation math *1400	0 / 0	4
1240	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	7
1239	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	10
1238	P1672G Cross Xor constructive algorithms graphs math matrices *3200	0 / 0	10
1223	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
1219	P1675D Vertical Paths graphs implementation trees *1300	0 / 0	4
1209	P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
1204	P1677C Tokitsukaze and Two Colorful Tapes constructive algorithms dfs and similar graphs greedy *1900	0 / 0	6
1194	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6
1186	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
1175	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
1174	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
1156	P1687B Railway System constructive algorithms graphs greedy interactive sortings *1700	0 / 0	5
1144	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
1138	P1690F Shifting String graphs math number theory strings *1700	0 / 0	5
1132	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
1120	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
1112	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
1109	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	10
1103	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
1096	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
1095	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
1089	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
1066	P1702E Split Into Two Sets dfs and similar dsu graphs *1600	0 / 0	5
1051	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
1032	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
1021	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
1014	P1711B Party brute force graphs *1300	0 / 0	4
990	P1715D 2+ doors 2-sat bitmasks graphs greedy *1900	0 / 0	6
989	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
976	P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
970	P1718E Impressionism constructive algorithms graphs implementation math *3500	0 / 0	10
954	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
934	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	6
931	P1726C Jatayu's Balanced Bracket Sequence data structures dsu graphs greedy *1300	0 / 0	4
930	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
878	P1735C Phase Shift dfs and similar dsu graphs greedy implementation strings *1400	0 / 0	4
865	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
858	P1738D Permutation Addicts constructive algorithms data structures dfs and similar dsu graphs trees *1900	0 / 0	6
856	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
850	P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees *1900	0 / 0	6
839	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
835	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
832	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
787	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
773	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
764	P1758E Tick, Tock combinatorics dfs and similar dsu graphs *2500	0 / 0	9
749	P1760G SlavicG's Favorite Problem bitmasks dfs and similar graphs *1700	0 / 0	5
746	P1761C Set Construction constructive algorithms dfs and similar graphs greedy *1400	0 / 0	4
744	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	9
729	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
728	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
725	P1764C Doremy's City Construction graphs greedy *1400	0 / 0	4
710	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
693	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
688	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
682	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
646	P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
638	P1776F Train Splitting constructive algorithms graphs greedy *1700	0 / 0	5
634	P1776J Italian Data Centers graphs shortest paths *2500	0 / 0	9

试试手气

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

关于

分类

状态

开发

支持

关于

还没有账户？

登录