ID	题目显示标签隐藏标签	AC / 尝试	难度
2669	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	提高
2668	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	CTSC
2667	P1366G Construct the String data structures dp strings *2700	0 / 0	CTSC
2662	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	普及
2661	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	提高
2660	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	NOI
2652	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	CTSC
2647	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	普及
2645	P1369F BareLee dfs and similar dp games *2700	0 / 0	CTSC
2641	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	提高
2632	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	省选
2627	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	提高
2626	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	CTSC
2621	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	普及
2620	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	省选
2599	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	提高
2597	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	CTSC
2592	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	普及-
2589	P1380F Strange Addition data structures dp matrices *2600	0 / 0	CTSC
2585	P1381B Unmerge dp *1800	0 / 0	普及
2583	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	CTSC
2580	P1382B Sequential Nim dp games *1100	0 / 0	普及-
2578	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	普及
2577	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	CTSC
2575	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	CTSC
2572	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	普及
2571	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	省选
2567	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	普及
2560	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	提高
2559	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	提高
2557	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	CTSC
2550	P1389B Array Walk brute force dp greedy *1600	0 / 0	普及
2549	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	普及
2546	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	CTSC
2545	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	CTSC
2542	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	普及
2541	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	提高
2536	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	普及
2533	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	CTSC
2532	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	CTSC
2527	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	提高
2526	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	CTSC
2525	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	CTSC
2524	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	普及
2521	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	CTSC
2517	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	普及
2514	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	省选
2507	P1398C Good Subarrays data structures dp math *1600	0 / 0	普及
2506	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	普及
2504	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	NOI
2496	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	省选
2491	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	省选
2490	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	CTSC
2489	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	CTSC
2485	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	普及
2480	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	CTSC
2477	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	CTSC
2475	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	普及
2468	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	普及-
2461	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	省选
2460	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	NOI
2457	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	普及
2456	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	提高
2453	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	CTSC
2451	P1408I Bitwise Magic dp math *3200	0 / 0	CTSC
2446	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	普及
2445	P1409F Subsequences of Length Two dp strings *2100	0 / 0	提高
2435	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	普及
2429	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	普及-
2426	P1415F Cakes for Clones dp *2900	0 / 0	CTSC
2423	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	提高
2421	P1416E Split binary search data structures dp greedy *3200	0 / 0	CTSC
2415	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	普及
2401	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	普及-
2400	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	提高
2398	P1420E Battle Lemmings dp greedy *2500	0 / 0	NOI
2393	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	CTSC
2390	P1422C Bargain combinatorics dp math *1700	0 / 0	普及
2388	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	CTSC
2377	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	NOI
2369	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	CTSC
2367	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	省选
2357	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	提高
2354	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	提高
2343	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	NOI
2342	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	CTSC
2341	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	CTSC
2334	P1430F Realistic Gameplay dp greedy *2600	0 / 0	CTSC
2333	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	CTSC
2326	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	提高
2323	P1431J Zero-XOR Array special problem dp 3400	0 / 0	CTSC
2317	P1433F Zero Remainder Sum dp *2100	0 / 0	提高
2306	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	普及
2304	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	省选
2303	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	CTSC
2291	P1439D INOI Final Contests combinatorics dp fft *3100	0 / 0	CTSC
2287	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	普及
2284	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	CTSC
2283	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	CTSC
2280	P1443B Saving the City dp greedy math sortings *1300	0 / 0	普及-

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

状态

开发

开源
API

支持

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

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录