ID	题目显示标签隐藏标签	AC / 尝试	难度
2944	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	普及
2935	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	省选
2924	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	普及
2919	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	CTSC
2918	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	NOI
2907	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	普及-
2905	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	省选
2898	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	普及
2897	P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	普及
2870	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	提高
2864	P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	普及
2863	P1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	省选
2854	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	省选
2847	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	CTSC
2840	P1338E JYPnation graphs *3500	0 / 0	CTSC
2836	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	普及
2835	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	NOI
2834	P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	CTSC
2833	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	CTSC
2819	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	提高
2816	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	提高
2815	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	CTSC
2806	P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	普及
2805	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	普及
2795	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	CTSC
2792	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	提高
2764	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	提高
2711	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	普及-
2707	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	普及
2705	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	NOI
2703	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	CTSC
2682	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	提高
2677	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	普及
2668	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	CTSC
2662	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	普及
2655	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	NOI
2653	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	CTSC
2647	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	普及
2639	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	NOI
2638	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	CTSC
2604	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	CTSC
2579	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	普及
2577	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	CTSC
2576	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	CTSC
2574	P1383F Special Edges flows graphs *3200	0 / 0	CTSC
2566	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	提高
2564	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	省选
2553	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	提高
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	普及
2540	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	CTSC
2531	P1392I Kevin and Grid fft graphs math *3300	0 / 0	CTSC
2523	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	省选
2496	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	省选
2480	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	CTSC
2479	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	NOI
2478	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	省选
2472	P1404E Bricks flows graph matchings graphs *2800	0 / 0	CTSC
2467	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	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
2455	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	NOI
2453	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	CTSC
2442	P1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	普及
2422	P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	CTSC
2415	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	普及
2404	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	CTSC
2389	P1422D Returning Home graphs shortest paths sortings *2300	0 / 0	省选
2385	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	普及
2384	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	CTSC
2379	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	NOI
2371	P1424M Ancient Language graphs sortings *2200	0 / 0	省选
2350	P1427G One Billion Shades of Grey flows graphs *3300	0 / 0	CTSC
2347	P1428B Belted Rooms graphs implementation *1200	0 / 0	普及-
2333	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	CTSC
2316	P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	提高
2311	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	普及
2305	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	普及
2294	P1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	普及
2293	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	CTSC
2285	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	NOI
2275	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	NOI
2256	P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	CTSC
2227	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	提高
2214	P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	CTSC
2205	P1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	省选
2192	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	NOI
2184	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	提高
2182	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	CTSC
2166	P1468J Road Reform dsu graphs greedy *1800	0 / 0	普及
2163	P1468M Similar Sets data structures graphs implementation *2300	0 / 0	省选
2154	P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	普及
2152	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	省选
2151	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	CTSC
2145	P1472C Long Jumps dp graphs *1100	0 / 0	普及-
2141	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	提高
2136	P1473E Minimum Path graphs shortest paths *2400	0 / 0	NOI
2125	P1475C Ball in Berland combinatorics graphs math *1400	0 / 0	普及-
2118	P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	普及
2116	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	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

其他

状态

开发

支持

分类

状态

开发

支持

还没有账户？

登录