ID	题目显示标签隐藏标签	AC / 尝试	难度
1019	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	普及
1018	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	NOI
1017	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	CTSC
1012	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	提高
1007	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	普及
1006	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	CTSC
1005	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	省选
983	P1686B Odd Subarrays dp greedy *800	0 / 0	普及-
971	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	普及
970	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	普及
956	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	NOI
949	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	普及-
948	P1692H Gambling data structures dp greedy math *1700	0 / 0	普及
946	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	普及
944	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	CTSC
937	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	普及
936	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	省选
935	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	省选
926	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	CTSC
921	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	NOI
909	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	省选
908	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	CTSC
904	P1700D River Locks binary search dp greedy math *1900	0 / 0	普及
902	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	CTSC
897	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	NOI
882	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	普及-
881	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	普及
876	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	省选
875	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	CTSC
873	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	CTSC
864	P1706B Making Towers dp greedy math *1100	0 / 0	普及-
863	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	普及-
861	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	NOI
856	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	CTSC
854	P1707F Bugaboo bitmasks constructive algorithms dp number theory *3500	0 / 0	CTSC
850	P1709B Also Try Minecraft data structures dp implementation *900	0 / 0	普及-
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
829	P1713C Build Permutation constructive algorithms dp math *1200	0 / 0	普及-
826	P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	CTSC
822	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	普及
814	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	NOI
810	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	提高
809	P1716D Chip Move brute force dp math *2000	0 / 0	提高
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
800	P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	普及
799	P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	普及
787	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	普及
786	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	NOI
780	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	省选
774	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	普及
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
759	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	普及
747	P1728D Letter Picking constructive algorithms dp games two pointers *1800	0 / 0	普及
744	P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	CTSC
737	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	提高
731	P1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	CTSC
727	P1731D Valiant's New Map binary search brute force data structures dp two pointers *1700	0 / 0	普及
726	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	提高
725	P1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	NOI
723	P1732B Ugu brute force dp greedy implementation *900	0 / 0	普及-
718	P1732E Location data structures dp math number theory *2800	0 / 0	CTSC
713	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	提高
712	P1733E Conveyor constructive algorithms dp math *2700	0 / 0	CTSC
708	P1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	普及
706	P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	NOI
696	P1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	NOI
694	P1736E Swap and Take dp greedy *2600	0 / 0	CTSC
690	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	省选
689	P1737E Ela Goes Hiking combinatorics dp math probabilities *2500	0 / 0	NOI
684	P1738C Even Number Addicts dp games greedy math *1500	0 / 0	普及
682	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	省选
680	P1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	CTSC
676	P1739C Card Game combinatorics constructive algorithms dp games *1500	0 / 0	普及
674	P1739E Cleaning Robot bitmasks dp *2400	0 / 0	NOI
673	P1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	CTSC
668	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	普及
667	P1740F Conditional Mix combinatorics dp math *2600	0 / 0	CTSC
664	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	CTSC
659	P1741E Sending a Sequence Over the Network dp *1600	0 / 0	普及
657	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	省选
647	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	普及-
646	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	普及
645	P1743E FTL binary search dp *2400	0 / 0	NOI
644	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	省选
643	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	CTSC
632	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	普及
630	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	CTSC
628	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	CTSC
623	P1747E List Generation combinatorics dp math *2900	0 / 0	CTSC
620	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	普及
618	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	省选
613	P1749D Counting Arrays combinatorics dp math number theory *1900	0 / 0	普及
606	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	NOI
605	P1750F Majority combinatorics dp math strings *2700	0 / 0	CTSC
604	P1750G Doping combinatorics dp math *3300	0 / 0	CTSC
603	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	CTSC
602	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	普及-

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

状态

开发

开源
API

支持

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录