ID	题目显示标签隐藏标签	AC / 尝试	难度
4108	P1088F Ehab and a weird weight formula data structures trees *2800	0 / 0	CTSC
4035	P1098D Eels data structures *2800	0 / 0	CTSC
3975	P1109C Sasha and a Patient Friend binary search data structures implementation *2800	0 / 0	CTSC
3832	P1142D Foreigner dp *2800	0 / 0	CTSC
3773	P1152F1 Neko Rules the Catniverse (Small Version) bitmasks dp matrices *2800	0 / 0	CTSC
3753	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	CTSC
3470	P1208G Polygons greedy math number theory *2800	0 / 0	CTSC
3426	P1214H Tiles Placement constructive algorithms dfs and similar trees *2800	0 / 0	CTSC
3406	P1218A BubbleReactor dp graphs *2800	0 / 0	CTSC
3182	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	CTSC
3125	P1279F New Year and Handle Change binary search dp *2800	0 / 0	CTSC
3088	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	CTSC
3068	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	CTSC
3003	P1303F Number of Components dsu implementation *2800	0 / 0	CTSC
2977	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	CTSC
2946	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	CTSC
2934	P1322D Reality Show bitmasks dp *2800	0 / 0	CTSC
2902	P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	CTSC
2674	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	CTSC
2631	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	CTSC
2604	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	CTSC
2597	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	CTSC
2595	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	CTSC
2576	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	CTSC
2575	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	CTSC
2561	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	CTSC
2545	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	CTSC
2526	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	CTSC
2521	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	CTSC
2490	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	CTSC
2473	P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	CTSC
2472	P1404E Bricks flows graph matchings graphs *2800	0 / 0	CTSC
2432	P1413F Roads and Ramen data structures trees *2800	0 / 0	CTSC
2404	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	CTSC
2374	P1423M Milutin's Plums interactive *2800	0 / 0	CTSC
2363	P1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	CTSC
2309	P1436F Sum Over Subsets combinatorics math number theory *2800	0 / 0	CTSC
2284	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	CTSC
2220	P1455F String and Operations dp greedy *2800	0 / 0	CTSC
2134	P1473G Tiles combinatorics dp fft math *2800	0 / 0	CTSC
2110	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	CTSC
2055	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	CTSC
2039	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	CTSC
1945	P1510F Fiber Shape *2800	0 / 0	CTSC
1860	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	CTSC
1745	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	CTSC
1668	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	CTSC
1604	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	CTSC
1579	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	CTSC
1578	P1578B Building Forest Trails data structures dsu *2800	0 / 0	CTSC
1569	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	CTSC
1512	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	CTSC
1449	P1606F Tree Queries brute force dp trees *2800	0 / 0	CTSC
1436	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	CTSC
1428	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	CTSC
1403	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	CTSC
1384	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	CTSC
1347	P1620F Bipartite Array dp greedy *2800	0 / 0	CTSC
1313	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	CTSC
1307	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	CTSC
1272	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	CTSC
1260	P1635F Closest Pair data structures greedy *2800	0 / 0	CTSC
1205	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	CTSC
1182	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	CTSC
1064	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	CTSC
992	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	CTSC
987	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	CTSC
944	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	CTSC
920	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	CTSC
914	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	CTSC
779	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	CTSC
763	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	CTSC
718	P1732E Location data structures dp math number theory *2800	0 / 0	CTSC
629	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	CTSC
611	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	CTSC
534	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	CTSC
523	P1766F MCF flows *2800	0 / 0	CTSC
423	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	CTSC
398	P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	CTSC
346	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	CTSC
194	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	CTSC
187	P1809G Prediction combinatorics dp math *2800	0 / 0	CTSC
181	P1810F M-tree data structures math sortings trees *2800	0 / 0	CTSC
145	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	CTSC
107	P1826F Fading into Fog geometry interactive math probabilities *2800	0 / 0	CTSC
102	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	CTSC
86	P1830D Mex Tree brute force dp trees *2800	0 / 0	CTSC
16	P1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	CTSC
486	P1844F2 Min Cost Permutation (Hard Version) binary search constructive algorithms data structures greedy math sortings *2800	0 / 0	CTSC
446	P1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	CTSC
8891	P1879F Last Man Standing brute force data structures number theory *2800	0 / 0	CTSC
8986	P1884E Hard Design greedy implementation math *2800	0 / 0	CTSC
9059	P1913F Palindromic Problem binary search data structures hashing string suffix structures strings *2800	0 / 0	CTSC
9021	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	CTSC
9183	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	CTSC
9248	P1976F Remove Bridges data structures dfs and similar dp greedy sortings trees *2800	0 / 0	CTSC
9343	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	CTSC

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

状态

开发

开源
API

支持

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录