ID	题目显示标签隐藏标签	AC / 尝试	难度
3463	P1209E2 Rotate Columns (hard version) bitmasks dp greedy sortings *2500	0 / 0	NOI
3444	P1211G King's Path special problem math trees 2500	0 / 0	NOI
3402	P1218E Product Tuples divide and conquer fft *2500	0 / 0	NOI
3384	P1221E Game With String games *2500	0 / 0	NOI
3368	P1225F Tree Factory constructive algorithms greedy trees *2500	0 / 0	NOI
3352	P1228F One Node is Gone constructive algorithms implementation trees *2500	0 / 0	NOI
3336	P1236E Alice and the Unfair Game binary search data structures dp dsu *2500	0 / 0	NOI
3317	P1239B The World Is Just a Programming Task (Hard Version) implementation *2500	0 / 0	NOI
3265	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	NOI
3257	P1251F Red-White Fence combinatorics fft *2500	0 / 0	NOI
3239	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	NOI
3121	P1280D Miss Punyverse dp greedy trees *2500	0 / 0	NOI
3100	P1284E New Year and Castle Construction combinatorics geometry math sortings *2500	0 / 0	NOI
3020	P1301E Nanosoft binary search data structures dp implementation *2500	0 / 0	NOI
2989	P1305F Kuroni and the Punishment math number theory probabilities *2500	0 / 0	NOI
2982	P1307E Cow and Treats binary search combinatorics dp greedy implementation math *2500	0 / 0	NOI
2978	P1310B Double Elimination dp implementation *2500	0 / 0	NOI
2962	P1312F Attack on Red Kingdom games two pointers *2500	0 / 0	NOI
2956	P1313D Happy New Year bitmasks dp implementation *2500	0 / 0	NOI
2942	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	NOI
2918	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	NOI
2903	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	NOI
2875	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	NOI
2862	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	NOI
2763	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	NOI
2705	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	NOI
2655	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	NOI
2612	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	NOI
2606	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	NOI
2584	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	NOI
2558	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	NOI
2504	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	NOI
2460	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	NOI
2411	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	NOI
2398	P1420E Battle Lemmings dp greedy *2500	0 / 0	NOI
2379	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	NOI
2352	P1427E Xum bitmasks constructive algorithms math matrices number theory *2500	0 / 0	NOI
2297	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	NOI
2275	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	NOI
2240	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	NOI
2176	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	NOI
2169	P1468G Hobbits binary search geometry *2500	0 / 0	NOI
2167	P1468I Plane Tiling geometry implementation math *2500	0 / 0	NOI
2153	P1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	NOI
2129	P1474E What Is It? constructive algorithms greedy *2500	0 / 0	NOI
2101	P1479C Continuous City bitmasks constructive algorithms *2500	0 / 0	NOI
2092	P1481E Sorting Books data structures dp greedy *2500	0 / 0	NOI
2078	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	NOI
2056	P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	NOI
2032	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	NOI
2007	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	NOI
2005	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	NOI
1999	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	NOI
1968	P1505H L BREAK into program special problem 2500	0 / 0	NOI
1957	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	NOI
1920	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	NOI
1901	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	NOI
1896	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	NOI
1875	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	NOI
1847	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	NOI
1843	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	NOI
1803	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	NOI
1769	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	NOI
1729	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	NOI
1719	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	NOI
1675	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	NOI
1657	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	NOI
1640	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	NOI
1611	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	NOI
1606	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	NOI
1595	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	NOI
1537	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	NOI
1521	P1585G Poachers dp games graphs trees *2500	0 / 0	NOI
1409	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	NOI
1402	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	NOI
1326	P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	NOI
1314	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	NOI
1254	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	NOI
1210	P1647E Madoka and the Sixth-graders data structures dfs and similar greedy *2500	0 / 0	NOI
1159	P1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	NOI
1140	P1661E Narrow Components brute force data structures dp dsu math trees *2500	0 / 0	NOI
1111	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	NOI
1106	P1666E Even Split binary search constructive algorithms greedy math *2500	0 / 0	NOI
1056	P1673E Power or XOR? bitmasks combinatorics math number theory *2500	0 / 0	NOI
1028	P1677D Tokitsukaze and Permutations dp math *2500	0 / 0	NOI
980	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	NOI
969	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	NOI
956	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	NOI
897	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	NOI
896	P1701F Points combinatorics data structures implementation math matrices *2500	0 / 0	NOI
846	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	NOI
843	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	NOI
833	P1712E2 LCM Sum (hard version) brute force data structures math number theory two pointers *2500	0 / 0	NOI
808	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	NOI
807	P1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	NOI
801	P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	NOI
767	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	NOI
762	P1725J Journey dp trees *2500	0 / 0	NOI
761	P1725K Kingdom of Criticism data structures dsu *2500	0 / 0	NOI
725	P1731F Function Sum brute force combinatorics dp fft math *2500	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

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录