ID	题目显示标签隐藏标签	AC / 尝试	难度
4291	P1045B Space Isaac hashing number theory *2400	0 / 0	NOI
4285	P1045H Self-exploration math *2400	0 / 0	NOI
4272	P1051F The Shortest Statement graphs shortest paths trees *2400	0 / 0	NOI
4265	P1054E Chips Puzzle constructive algorithms implementation math *2400	0 / 0	NOI
4258	P1055D Refactoring greedy implementation strings *2400	0 / 0	NOI
4239	P1059E Split the Tree binary search data structures dp greedy trees *2400	0 / 0	NOI
4225	P1061F Lost Root interactive probabilities *2400	0 / 0	NOI
4188	P1070B Berkomnadzor data structures greedy *2400	0 / 0	NOI
4181	P1070I Privatization of Roads in Berland flows graph matchings graphs *2400	0 / 0	NOI
4147	P1080E Sonya and Matrix Beauty strings *2400	0 / 0	NOI
4146	P1080F Katya and Segments Sets data structures interactive sortings *2400	0 / 0	NOI
4131	P1082G Petya and Graph flows graphs *2400	0 / 0	NOI
4126	P1083E The Fair Nut and Rectangles data structures dp geometry *2400	0 / 0	NOI
4109	P1088E Ehab and a component choosing problem dp greedy math trees *2400	0 / 0	NOI
4097	P1089K King Kog's Reception data structures *2400	0 / 0	NOI
4092	P1090C New Year Presents constructive algorithms data structures *2400	0 / 0	NOI
4077	P1091E New Year and the Acquaintance Estimation binary search data structures graphs greedy implementation math sortings *2400	0 / 0	NOI
4062	P1093E Intersection of Permutations data structures *2400	0 / 0	NOI
4061	P1093F Vasya and Array dp *2400	0 / 0	NOI
4047	P1096G Lucky Tickets divide and conquer dp fft *2400	0 / 0	NOI
4036	P1098C Construct a tree binary search constructive algorithms dfs and similar graphs greedy trees *2400	0 / 0	NOI
4029	P1099F Cookies binary search data structures dfs and similar dp games trees *2400	0 / 0	NOI
4017	P1101F Trucks and Cities binary search dp *2400	0 / 0	NOI
3992	P1106F Lunar New Year and a Recursive Sequence math matrices number theory *2400	0 / 0	NOI
3987	P1107E Vasya and Binary String dp *2400	0 / 0	NOI
3985	P1107G Vasya and Maximum Profit binary search constructive algorithms data structures dp dsu *2400	0 / 0	NOI
3974	P1109D Sasha and Interesting Fact from Graph Theory brute force combinatorics dp math trees *2400	0 / 0	NOI
3951	P1114F Please, another Queries on Array? bitmasks data structures divide and conquer math number theory *2400	0 / 0	NOI
3896	P1129C Morse Code binary search data structures dp hashing sortings string suffix structures strings *2400	0 / 0	NOI
3877	P1132G Greedy Subsequences data structures dp trees *2400	0 / 0	NOI
3861	P1137D Cooperative Game constructive algorithms interactive number theory *2400	0 / 0	NOI
3852	P1139E Maximize Mex flows graph matchings graphs *2400	0 / 0	NOI
3833	P1142C U2 geometry *2400	0 / 0	NOI
3821	P1144G Two Merged Sequences dp greedy *2400	0 / 0	NOI
3809	P1146E Hot is Cold bitmasks data structures divide and conquer implementation *2400	0 / 0	NOI
3802	P1147D Palindrome XOR dfs and similar graphs *2400	0 / 0	NOI
3774	P1152E Neko and Flashback constructive algorithms dfs and similar graphs *2400	0 / 0	NOI
3720	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	NOI
3706	P1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	NOI
3668	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	NOI
3627	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	NOI
3603	P1184E3 Daleks' Invasion (hard) data structures dsu graphs trees *2400	0 / 0	NOI
3589	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	NOI
3585	P1187D Subarray Sorting data structures sortings *2400	0 / 0	NOI
3553	P1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	0 / 0	NOI
3507	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	NOI
3489	P1205C Palindromic Paths implementation interactive *2400	0 / 0	NOI
3455	P1210D Konrad and Company Evaluation graphs *2400	0 / 0	NOI
3403	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	NOI
3383	P1221F Choose a Square binary search data structures sortings *2400	0 / 0	NOI
3359	P1227F2 Wrong Answer on test 233 (Hard Version) combinatorics math *2400	0 / 0	NOI
3329	P1237E Balanced Binary Search Trees dp math *2400	0 / 0	NOI
3315	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	NOI
3309	P1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	NOI
3297	P1244G Running in Pairs constructive algorithms greedy math *2400	0 / 0	NOI
3258	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	NOI
3251	P1252F Regular Forestation hashing trees *2400	0 / 0	NOI
3218	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	NOI
3212	P1260E Tournament brute force dp greedy *2400	0 / 0	NOI
3204	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	NOI
3201	P1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	NOI
3111	P1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	NOI
3089	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	NOI
3074	P1290C Prefix Enlightenment dfs and similar dsu graphs *2400	0 / 0	NOI
2995	P1304F2 Animal Observation (hard version) data structures dp greedy *2400	0 / 0	NOI
2912	P1326E Bombs data structures two pointers *2400	0 / 0	NOI
2893	P1329C Drazil Likes Heap constructive algorithms data structures greedy implementation *2400	0 / 0	NOI
2869	P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	NOI
2835	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	NOI
2818	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	NOI
2796	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	NOI
2723	P1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	NOI
2660	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	NOI
2646	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	NOI
2639	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	NOI
2619	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	NOI
2611	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	NOI
2534	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	NOI
2484	P1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	NOI
2483	P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	NOI
2479	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	NOI
2455	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	NOI
2413	P1418E Expected Damage binary search combinatorics probabilities *2400	0 / 0	NOI
2377	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	NOI
2343	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	NOI
2310	P1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	NOI
2285	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	NOI
2278	P1443E Long Permutation brute force math two pointers *2400	0 / 0	NOI
2255	P1450F The Struggling Contestant constructive algorithms greedy *2400	0 / 0	NOI
2221	P1455E Four Points brute force constructive algorithms flows geometry greedy implementation math ternary search *2400	0 / 0	NOI
2192	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	NOI
2157	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	NOI
2136	P1473E Minimum Path graphs shortest paths *2400	0 / 0	NOI
2085	P1482F Useful Edges graphs shortest paths *2400	0 / 0	NOI
2077	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	NOI
2041	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	NOI
2021	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	NOI
1994	P1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	NOI
1993	P1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	NOI
1870	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	NOI

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

状态

开发

开源
API

支持

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录