ID	题目显示标签隐藏标签	AC / 尝试	难度
1854	P1526E Oolimry and Suffix Array combinatorics constructive algorithms math *2400	0 / 0	NOI
1848	P1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	NOI
1755	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	NOI
1581	P1575M Managing Telephone Poles data structures geometry *2400	0 / 0	NOI
1568	P1578L Labyrinth binary search dsu greedy *2400	0 / 0	NOI
1544	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	NOI
1523	P1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	NOI
1522	P1585F Non-equal Neighbours combinatorics dp math *2400	0 / 0	NOI
1514	P1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	NOI
1497	P1594F Ideal Farm constructive algorithms math *2400	0 / 0	NOI
1491	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	NOI
1456	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	NOI
1451	P1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	NOI
1437	P1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	NOI
1429	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	NOI
1385	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	NOI
1369	P1617D2 Too Many Impostors (hard version) constructive algorithms implementation interactive math *2400	0 / 0	NOI
1353	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	NOI
1346	P1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	NOI
1308	P1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	NOI
1296	P1628D2 Game on Sum (Hard Version) combinatorics dp games math *2400	0 / 0	NOI
1288	P1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	NOI
1279	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	NOI
1273	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	NOI
1267	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	NOI
1247	P1638E Colorful Operations brute force data structures implementation *2400	0 / 0	NOI
1096	P1667C Half Queen Cover constructive algorithms math *2400	0 / 0	NOI
1077	P1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	NOI
1055	P1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	NOI
1018	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	NOI
1013	P1680D Dog Walking brute force greedy math *2400	0 / 0	NOI
921	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	NOI
861	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	NOI
857	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	NOI
847	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	NOI
841	P1710E Two Arrays binary search games graph matchings *2400	0 / 0	NOI
827	P1713E Cross Swapping 2-sat data structures dsu greedy matrices *2400	0 / 0	NOI
814	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	NOI
797	P1718C Tonya and Burenka-179 data structures greedy math number theory *2400	0 / 0	NOI
786	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	NOI
760	P1725L Lemper Cooking Competition data structures *2400	0 / 0	NOI
754	P1726E Almost Perfect combinatorics fft math *2400	0 / 0	NOI
719	P1732D2 Balance (Hard version) brute force data structures number theory *2400	0 / 0	NOI
701	P1735E House Planning constructive algorithms data structures graph matchings greedy *2400	0 / 0	NOI
696	P1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	NOI
681	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	NOI
674	P1739E Cleaning Robot bitmasks dp *2400	0 / 0	NOI
645	P1743E FTL binary search dp *2400	0 / 0	NOI
612	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	NOI
606	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	NOI
598	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	NOI
569	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	NOI
548	P1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	NOI
542	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	NOI
531	P1765L Project Manager brute force data structures implementation *2400	0 / 0	NOI
506	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	NOI
412	P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	NOI
382	P1777F Comfortably Numb bitmasks data structures divide and conquer strings trees *2400	0 / 0	NOI
371	P1779E Anya's Simultaneous Exhibition constructive algorithms graphs greedy interactive sortings *2400	0 / 0	NOI
364	P1780E Josuke and Complete Graph binary search brute force data structures math number theory *2400	0 / 0	NOI
362	P1780G Delicious Dessert binary search dsu hashing math number theory string suffix structures *2400	0 / 0	NOI
342	P1784D Wooden Spoon combinatorics dp *2400	0 / 0	NOI
296	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	NOI
283	P1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	NOI
277	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	NOI
226	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	NOI
189	P1809E Two Tanks binary search dp implementation math *2400	0 / 0	NOI
154	P1817C Similar Polynomials combinatorics math *2400	0 / 0	NOI
146	P1819C The Fox and the Complete Tree Traversal constructive algorithms dp implementation math trees *2400	0 / 0	NOI
108	P1826E Walk the Runway bitmasks brute force data structures dp graphs implementation sortings *2400	0 / 0	NOI
104	P1827B2 Range Sorting (Hard Version) binary search data structures dp greedy *2400	0 / 0	NOI
87	P1830C Hyperregular Bracket Strings combinatorics greedy hashing math number theory sortings *2400	0 / 0	NOI
77	P1832D2 Red-Blue Operations (Hard Version) binary search constructive algorithms greedy implementation math *2400	0 / 0	NOI
48	P1837F Editorial for Two binary search data structures greedy implementation *2400	0 / 0	NOI
37	P1839E Decreasing Game constructive algorithms dfs and similar dp greedy interactive *2400	0 / 0	NOI
488	P1844E Great Grids 2-sat constructive algorithms dfs and similar dsu graphs *2400	0 / 0	NOI
471	P1848F Vika and Wiki binary search bitmasks combinatorics divide and conquer dp math *2400	0 / 0	NOI
447	P1852C Ina of the Mountain data structures dp greedy math *2400	0 / 0	NOI
8892	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive math trees *2400	0 / 0	NOI
8984	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers *2400	0 / 0	NOI
9092	P1909E Multiple Lamps bitmasks brute force constructive algorithms math number theory *2400	0 / 0	NOI
9079	P1910H Sum of Digits of Sums special problem binary search data structures 2400	0 / 0	NOI
9069	P1912H Hypercatapult Commute graphs *2400	0 / 0	NOI
9060	P1913E Matrix Problem flows graphs *2400	0 / 0	NOI
9184	P1943D1 Counting Is Fun (Easy Version) brute force combinatorics dp math *2400	0 / 0	NOI
9286	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	NOI
9272	P1973D Cat, Fox and Maximum Array Split brute force interactive math *2400	0 / 0	NOI
9232	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers *2400	0 / 0	NOI
9224	P1980F2 Field Division (hard version) math sortings *2400	0 / 0	NOI
9219	P1981D Turtle and Multiplication constructive algorithms dfs and similar graphs number theory *2400	0 / 0	NOI
9211	P1984E Shuffle dp greedy trees *2400	0 / 0	NOI

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

状态

开发

开源
API

支持

2021-2023 莱芜一中信息学奥赛在线评测系统 LaiWu No.1 Middle School Online Judge System
Powered By Loi62-Hywel
鲁ICP备2022033691号
Worker 0, 36ms
Powered by Hydro v4.13.4 Community

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录