|
|
11781 |
ATabc147f
[ABC147F] Sum Difference
|
1 / 1 |
10 |
|
|
11830 |
ATabc155f
[ABC155F] Perils in Parallel
|
1 / 3 |
10 |
|
|
11882 |
ATabc164f
[ABC164F] I hate Matrix Construction
|
1 / 1 |
10 |
|
|
12239 |
ATabc219h
[ABC219H] Candles
|
1 / 1 |
10 |
|
|
12291 |
ATabc225f
[ABC225F] String Cards
|
1 / 1 |
10 |
|
|
12302 |
ATabc228h
[ABC228H] Histogram
|
1 / 1 |
10 |
|
|
10000 |
ATabc267g
[ABC267G] Increasing K Times
|
1 / 1 |
10 |
|
|
8779 |
ATagc005d
[AGC005D] ~K Perm Counting
|
1 / 1 |
10 |
|
|
8772 |
ATagc006c
[AGC006C] Rabbit Exercise
|
1 / 1 |
10 |
|
|
8767 |
ATagc007d
[AGC007D] Shik and Game
|
1 / 3 |
10 |
|
|
8769 |
ATagc007f
[AGC007F] Shik and Copying String
|
1 / 1 |
10 |
|
|
8744 |
ATagc011d
[AGC011D] Half Reflector
|
1 / 2 |
10 |
|
|
8737 |
ATagc012c
[AGC012C] Tautonym Puzzle
|
1 / 5 |
10 |
|
|
8689 |
ATagc019c
[AGC019C] Fountain Walk
|
1 / 1 |
10 |
|
|
8648 |
ATagc027d
[AGC027D] Modulo Matrix
|
1 / 1 |
10 |
|
|
8628 |
ATagc030c
[AGC030C] Coloring Torus
|
1 / 1 |
10 |
|
|
8616 |
ATagc032c
[AGC032C] Three Circuits
|
1 / 1 |
10 |
|
|
8605 |
ATagc034d
[AGC034D] Manhattan Max Matching
|
1 / 1 |
10 |
|
|
8606 |
ATagc034e
[AGC034E] Complete Compress
|
1 / 1 |
10 |
|
|
8599 |
ATagc035d
[AGC035D] Add and Remove
|
1 / 1 |
10 |
|
|
8498 |
ATagc037d
[AGC037D] Sorting a Grid
|
1 / 4 |
10 |
|
|
8499 |
ATagc037e
[AGC037E] Reversing and Concatenating
|
1 / 1 |
10 |
|
|
8491 |
ATagc038c
[AGC038C] LCMs
|
1 / 1 |
10 |
|
|
8467 |
ATagc043c
[AGC043C] Giant Graph
|
1 / 1 |
10 |
|
|
8468 |
ATagc043d
[AGC043D] Merge Triplets
|
1 / 1 |
10 |
|
|
8204 |
ATagc050a
[AGC050A] AtCoder Jumper
|
2 / 5 |
10 |
|
|
9496 |
ATarc067d
[ARC067F] Yakiniku Restaurants
|
1 / 1 |
10 |
|
|
9448 |
ATarc079d
[ARC079F] Namori Grundy
|
1 / 1 |
10 |
|
|
9424 |
ATarc085d
[ARC085F] NRE
|
1 / 3 |
10 |
|
|
9407 |
ATarc089c
[ARC089E] GraphXY
|
1 / 2 |
10 |
|
|
9384 |
ATarc095d
[ARC095F] Permutation Tree
|
1 / 1 |
10 |
|
|
9367 |
ATarc099c
[ARC099E] Independence
|
1 / 1 |
10 |
|
|
9368 |
ATarc099d
[ARC099F] Eating Symbols Hard
|
1 / 1 |
10 |
|
|
9360 |
ATarc101d
[ARC101F] Robots and Exits
|
1 / 1 |
10 |
|
|
9350 |
ATarc103b
[ABC111D] Robot Arms
|
1 / 3 |
10 |
|
|
174 |
ATarc145d
[ARC145D] Non Arithmetic Progression Set
|
0 / 1 |
10 |
|
|
192 |
ATarc148d
[ARC148D] mod M Game
|
1 / 1 |
10 |
|
|
2156 |
ATdpu
*【状态压缩DP】最大分组 Grouping
|
35 / 182 |
8 |
|
|
2195 |
ATdpv
E89 换根DP Subtree
|
16 / 123 |
8 |
|
|
2209 |
ATdpz
Frog 3
|
16 / 89 |
8 |
|
|
9071 |
ATfps24a
Snack
|
2 / 4 |
10 |
|
|
9076 |
ATfps24f
Colored Paper
|
1 / 2 |
10 |
|
|
332 |
CF600E
C66D32*【线段树合并 | 树上启发式合并】子树的"主导颜色"编号和 Lomsat gelral
|
46 / 260 |
8 |
|
|
12662 |
CF896C
Willem, Chtholly and Seniorious
|
1 / 1 |
10 |
|
|
12501 |
CF1005F
D94 最短路径树 BFS 算法 Berland and the Shortest Paths
|
3 / 7 |
10 |
|
|
4741 |
CF1009F
D34_1【模板】长链剖分 Dominant Indices
|
1 / 4 |
10 |
|
|
346 |
CF1709E
D33_1*【树上启发式合并】树上任何路径异或和不为零 XOR Tree
|
61 / 281 |
7 |
|
|
249 |
P1081
*【动态规划：状态设计DP】观光游览
|
37 / 59 |
2 |
|
|
324 |
P1129
*【一般图：最大独立集】一般图最大独立集[模板](未解决)
|
19 / 68 |
6 |
|
|
459 |
P1234
*【矩阵乘法】5：数列的第n项
|
15 / 47 |
6 |
|
|
460 |
P1235
*【递归】数独Ⅰ
|
34 / 114 |
6 |
|
|
502 |
P1277
*【组合数：普通生成函数】不能组成的最小面值[scy]
|
29 / 127 |
7 |
|
|
680 |
P1361
[NOIP普及组2015]扫雷游戏
|
11 / 16 |
7 |
|
|
699 |
P1399
*【宽搜（难度：6）】火柴人的末日
|
15 / 31 |
5 |
|
|
598 |
P1482
*【矩阵乘法】6：置换加速
|
19 / 41 |
4 |
|
|
622 |
P1505
*【动态规划：状态设计DP】数的划分[NOIP提高组2001]
|
38 / 255 |
8 |
|
|
853 |
P1674
*【链表】猴子选大王4
|
28 / 93 |
6 |
|
|
936 |
P1758
[欧拉图]路径的计数
|
1 / 1 |
10 |
|
|
941 |
P1763
HYY你不要再出毒瘤题了！
|
1 / 7 |
10 |
|
|
1010 |
P1831
[USACO2.3] 奶牛家谱 Cow Pedigrees
|
6 / 7 |
9 |
|
|
1070 |
P1891
【宽搜】Knight Moves[POJ1915]
|
0 / 0 |
(无) |
|
|
1082 |
P1903
B23 DFS剪枝 小木棍
|
67 / 286 |
7 |
|
|
1283 |
P1988
*【字典树】最大异或值路径[POJ3764]
|
50 / 229 |
7 |
|
|
1329 |
P2057
[USACO08JAN] Artificial Lake G
|
29 / 138 |
7 |
|
|
1381 |
P2109
0x50 动态规划（0x57 倍增优化DP）例题1：计算重复
|
21 / 86 |
7 |
|
|
1395 |
P2123
0x50 动态规划（0x5C 计数类DP）例题3：[CEOI 2002]装饰围栏
|
17 / 31 |
4 |
|
|
1396 |
P2124
*【数位DP】启示录[POJ3208]
|
34 / 68 |
4 |
|
|
1417 |
P2144
0x50 动态规划（练习）19：[SP16809] EST - Estimation
|
19 / 57 |
6 |
|
|
1422 |
P2149
[USACO07DEC] Gourmet Grazers G
|
22 / 27 |
2 |
|
|
1424 |
P2151
0x50 动态规划（练习）26：P10968 扑克牌
|
12 / 18 |
6 |
|
|
1426 |
P2153
E83 树上背包+二项式反演+排列组合[NOI Online #2 提高组] 游戏
|
3 / 31 |
9 |
|
|
1428 |
P2155
D76【最短路+DP】路径中的边权最大值最小[USACO08JAN] Telephone Lines S
|
50 / 164 |
6 |
|
|
1430 |
P2157
D69 最短路 拓扑【最短路】混合图最短路 [USACO11JAN] Roads and Planes G
|
36 / 215 |
8 |
|
|
1506 |
P2232
0x50 动态规划（0x5C 计数类DP）例题2：连通图（加强版）
|
1 / 4 |
10 |
|
|
1528 |
P2254
[GDKOI2023 普及组]置换
|
0 / 1 |
10 |
|
|
1531 |
P2257
[USACO09MAR] Moon Mooing G
|
0 / 0 |
(无) |
|
|
1556 |
P2272
*【计算几何：四点中心对称】[USACO11MAR] Bovine Bridge Battle S
|
3 / 3 |
10 |
|
|
1576 |
P2292
[USACO10DEC] Threatening Letter G
|
0 / 0 |
(无) |
|
|
1581 |
P2297
*【树状数组：逆序对】循环同构的最少交换次数[USACO10NOV] Cow Photographs G（好题）
|
1 / 1 |
10 |
|
|
1773 |
P2354
*【扩展欧几里得：解同余方程组】[POJ 2891]
|
21 / 128 |
8 |
|
|
1790 |
P2371
D58【最近公共祖先LCA】树上同组两点的最大距离[USACO10HOL] Cow Politics G
|
39 / 176 |
7 |
|
|
1890 |
P2470
[USACO07FEB] Lilypad Pond G
|
0 / 0 |
(无) |
|
|
1896 |
P2473
*【背包练习】用余数定义状态
|
28 / 165 |
8 |
|
|
1962 |
P2538
[欧拉图]欧拉路径计数
|
1 / 1 |
10 |
|
|
2041 |
P2617
[USACO13NOV] Empty Stalls G
|
0 / 0 |
(无) |
|
|
2043 |
P2619
[USACO13NOV] No Change G
|
0 / 0 |
(无) |
|
|
2138 |
P2714
简单的路径
|
9 / 33 |
7 |
|
|
2164 |
P2740
[USACO05MAR] Checking an Alibi S不在场的证明
|
1 / 1 |
10 |
|
|
2187 |
P2763
树上点修 & 路径复合求和（Point Set Tree Path Composite Sum (Fixed Root)）
|
3 / 4 |
10 |
|
|
2189 |
P2765
[USACO04OPEN] The Cow Lineup
|
10 / 10 |
9 |
|
|
2190 |
P2766
*【树状数组|归并排序】[USACO04OPEN] MooFest G（数据加强）
|
5 / 42 |
9 |
|
|
2248 |
P2824
USACO（78）Bellman-Ford 3：奶牛的站位
|
3 / 6 |
10 |
|
|
2829 |
P3176
[BalkanOI 2007] Mokia 摩基亚
|
4 / 5 |
10 |
|
|
2877 |
P3224
[HNOI2002] 彩票
|
0 / 21 |
10 |
|
|
2907 |
P3254
PROSTOR
|
0 / 19 |
10 |
|
|
2938 |
P3285
Acid Rain
|
0 / 44 |
10 |
|
|
2960 |
P3307
玩具
|
0 / 25 |
10 |
|
|
2966 |
P3313
取整矩阵
|
0 / 21 |
10 |
|
|
2986 |
P3333
[SPOJ231] 过马路 The Zebra Crossing
|
0 / 18 |
10 |
|
|
3022 |
P3369
[BalticOI 2003] Gem 气垫车
|
0 / 30 |
10 |
