|
|
11627 |
ATabc119d
[ABC119D] Lazy Faith
|
7 / 18 |
8 |
|
|
11772 |
ATabc146c
[ABC146C] Buy an Integer
|
12 / 16 |
6 |
|
|
11794 |
ATabc149e
[ABC149E] Handshake
|
1 / 1 |
10 |
|
|
11818 |
ATabc153f
[ABC153F] Silver Fox vs Monster
|
2 / 5 |
10 |
|
|
11944 |
ATabc174e
[ABC174E] Logs
|
2 / 2 |
10 |
|
|
11985 |
ATabc181e
[ABC181E] Transformable Teacher
|
2 / 2 |
10 |
|
|
11986 |
ATabc181f
[ABC181F] Silver Woods
|
1 / 1 |
10 |
|
|
12295 |
ATabc227d
[ABC227D] Project Planning
|
1 / 1 |
10 |
|
|
9963 |
ATabc255d
[ABC255D] ±1 Operation 2
|
1 / 1 |
10 |
|
|
10022 |
ATabc270e
[ABC270E] Apple Baskets on Circle
|
1 / 1 |
10 |
|
|
7023 |
ATabc282h
[ABC282Ex] Min + Sum
|
1 / 1 |
10 |
|
|
7781 |
ATabc287g
[ABC287G] Balance Update Query
|
1 / 1 |
10 |
|
|
9171 |
ATabc299d
[ABC299D] Find by Query
|
0 / 1 |
10 |
|
|
8839 |
ATabc319d
[ABC319D] Minimum Width
|
1 / 1 |
10 |
|
|
8825 |
ATabc321d
[ABC321D] Set Menu
|
1 / 1 |
10 |
|
|
8272 |
ATabc334d
[ABC334D] Reindeer and Sleigh
|
14 / 31 |
5 |
|
|
1699 |
ATabc341d
[ABC341D] Only one of two
|
5 / 5 |
10 |
|
|
765 |
ATabc344g
[ABC344G] Points and Comparison
|
3 / 3 |
10 |
|
|
1691 |
ATabc346f
[ABC346F] SSttrriinngg in StringString
|
5 / 6 |
10 |
|
|
1543 |
ATabc355c
[ABC355C] Bingo 2
|
8 / 22 |
7 |
|
|
1544 |
ATabc355d
[ABC355D] Intersecting Intervals
|
7 / 17 |
8 |
|
|
1539 |
ATabc356f
[ABC356F] Distance Component Size Query
|
2 / 2 |
10 |
|
|
1622 |
ATabc358d
[ABC358D] Souvenirs
|
9 / 20 |
7 |
|
|
1704 |
ATabc360d
[ABC360D] Ghost Ants
|
7 / 10 |
9 |
|
|
1662 |
ATabc364d
[ABC364D] K-th Nearest
|
6 / 12 |
9 |
|
|
7999 |
ATabc365c
[ABC365C] Transportation Expenses
|
12 / 37 |
6 |
|
|
7994 |
ATabc366e
[ABC366E] Manhattan Multifocal Ellipse
|
3 / 7 |
10 |
|
|
7960 |
ATabc370d
[ABC370D] Cross Explosion
|
5 / 14 |
9 |
|
|
7962 |
ATabc370f
[ABC370F] Cake Division
|
2 / 5 |
10 |
|
|
7955 |
ATabc371f
[ABC371F] Takahashi in Narrow Road
|
3 / 7 |
10 |
|
|
7940 |
ATabc373e
[ABC373E] How to Win the Election
|
2 / 16 |
9 |
|
|
7933 |
ATabc374e
[ABC374E] Sensor Optimization Dilemma 2
|
3 / 13 |
9 |
|
|
7917 |
ATabc376c
[ABC376C] Prepare Another Box
|
13 / 28 |
5 |
|
|
8773 |
ATagc006d
[AGC006D] Median Pyramid Hard
|
1 / 1 |
10 |
|
|
8768 |
ATagc007e
[AGC007E] Shik and Travel
|
1 / 2 |
10 |
|
|
8745 |
ATagc011e
[AGC011E] Increasing Numbers
|
1 / 1 |
10 |
|
|
8694 |
ATagc020b
[AGC020B] Ice Rink Game
|
16 / 76 |
7 |
|
|
8656 |
ATagc026f
[AGC026F] Manju Game
|
1 / 1 |
10 |
|
|
8618 |
ATagc032e
[AGC032E] Modulo Pairing
|
1 / 1 |
10 |
|
|
8604 |
ATagc034c
[AGC034C] Tests
|
1 / 1 |
10 |
|
|
8480 |
ATagc040d
[AGC040D] Balance Beam
|
1 / 1 |
10 |
|
|
8361 |
ATagc045f
[AGC045F] Division into Multiples
|
1 / 1 |
10 |
|
|
8334 |
ATagc049c
[AGC049C] Robots
|
1 / 2 |
10 |
|
|
8053 |
ATagc061d
[AGC061D] Almost Multiplication Table
|
1 / 4 |
10 |
|
|
9447 |
ATarc079c
[ARC079E] Decrease (Judge ver.)
|
1 / 1 |
10 |
|
|
9275 |
ATarc116e
[ARC116E] Spread of Information
|
6 / 14 |
8 |
|
|
163 |
ATarc158c
[ARC158C] All Pair Digit Sums
|
2 / 2 |
10 |
|
|
159 |
ATarc159e
[ARC159E] Difference Sum Query
|
2 / 2 |
10 |
|
|
202 |
ATarc165b
[ARC165B] Sliding Window Sort 2
|
6 / 41 |
8 |
|
|
203 |
ATarc165c
[ARC165C] Social Distance on Graph
|
5 / 27 |
8 |
|
|
11516 |
ATarc169b
[ARC169B] Subsegments with Small Sums
|
1 / 3 |
10 |
|
|
1251 |
ATarc179c
[ARC179C] Beware of Overflow
|
0 / 2 |
10 |
|
|
1279 |
P1984
*【字符串：hash值】后缀数组
|
41 / 72 |
3 |
|
|
1476 |
P2202
D139【最小生成树】无线通讯网
|
37 / 151 |
7 |
|
|
1574 |
P2290
D61 树的直径 二分 [USACO10DEC] Cow Calisthenics G
|
1 / 5 |
10 |
|
|
2056 |
P2632
D134 最小生成树 Kruskal 算法[USACO13FEB] Tractor S
|
10 / 46 |
7 |
|
|
2205 |
P2781
D142 最小生成树 Kruskal 算法+01分数规划[USACO01OPEN] Earthquake
|
1 / 2 |
10 |
|
|
2810 |
P3157
[CTSC2005] 合并正方形
|
0 / 58 |
10 |
|
|
3016 |
P3363
[BalticOI 2005] Polygon(无 spj)
|
0 / 11 |
10 |
|
|
3187 |
P3532
[POI 2005] KOS-Dicing
|
1 / 10 |
10 |
|
|
3423 |
P3767
[CEOI 2009] Harbingers
|
1 / 2 |
10 |
|
|
3732 |
P4067
[POI 2004] SZN
|
1 / 1 |
10 |
|
|
3800 |
P4135
刷题计划
|
0 / 0 |
(无) |
|
|
3809 |
P4144
*【LCA最近公共祖先】[国家集训队] 跳跳棋
|
3 / 4 |
10 |
|
|
4611 |
P4946
E6_1 [POI 2000] 公共串
|
17 / 69 |
7 |
|
|
5223 |
P5558
[ZJOI2010] 贪吃的老鼠
|
1 / 3 |
10 |
|
|
5400 |
P5735
[PA 2013] Konduktorzy
|
1 / 1 |
10 |
|
|
5943 |
P6278
[ONTAK2015] Tasowanie
|
1 / 1 |
10 |
|
|
6750 |
P7081
[USACO14FEB] Auto-complete S
|
6 / 69 |
9 |
|
|
6862 |
P7193
D08 [USACO16DEC] Moocast G
|
7 / 13 |
8 |
|
|
61 |
lg1083
[NOIP 2012 提高组] 借教室
|
34 / 107 |
6 |
|
|
1444 |
lg1084
[NOIP 2012 提高组] 疫情控制
|
17 / 49 |
6 |
|
|
2665 |
lg1198
A12*【ST表RMQ问题】[JSOI2008] 最大数
|
62 / 351 |
8 |
|
|
67 |
lg1314
[NOIP 2011 提高组] 聪明的质监员
|
12 / 32 |
6 |
|
|
2210 |
lg1381
A19 双指针 单词背诵
|
17 / 58 |
6 |
|
|
1344 |
lg1525
D170 二分图判定 二分+染色法[NOIP 2010 提高组] 关押罪犯
|
47 / 100 |
4 |
|
|
12646 |
lg1631
A22 堆 序列合并
|
14 / 27 |
5 |
|
|
1072 |
lg1638
A18 双指针（尺取法） 最小全覆盖区间[逛画展]
|
30 / 104 |
6 |
|
|
7205 |
lg1642
E95 【01分数规划+树上背包 】 规划（加强数据）
|
2 / 22 |
9 |
|
|
2603 |
lg1824
*【二分】最小值最大[USACO05FEB] 进击的奶牛 Aggressive Cows G
|
61 / 170 |
5 |
|
|
12647 |
lg1843
A28 贪心算法 [奶牛晒衣服]
|
14 / 46 |
6 |
|
|
2212 |
lg1873
[COCI 2011/2012 #5] EKO / 砍树
|
26 / 92 |
6 |
|
|
4703 |
lg1883
【模板】三分 / 函数 / [ICPC 2010 Chengdu R] Error Curves
|
1 / 4 |
10 |
|
|
2605 |
lg2115
*【二分】平均值最小[USACO14MAR]Sabotage
|
37 / 72 |
3 |
|
|
2705 |
lg2218
[HAOI2007] 覆盖问题
|
12 / 42 |
7 |
|
|
2849 |
lg2323
[HNOI2006] 公路修建问题
|
5 / 20 |
8 |
|
|
2736 |
lg2330
[SCOI2005] 繁忙的都市
|
19 / 22 |
3 |
|
|
5335 |
lg2375
[NOI2014] 动物园
|
2 / 3 |
10 |
|
|
5334 |
lg2387
[NOI2014] 魔法森林
|
2 / 5 |
10 |
|
|
310 |
lg2402
*【网络流】奶牛隐藏
|
39 / 157 |
7 |
|
|
2211 |
lg2440
A06*【二分】木材加工
|
39 / 287 |
8 |
|
|
6363 |
lg2463
[SDOI2008] Sandy 的卡片
|
1 / 1 |
10 |
|
|
3591 |
lg2468
C54 可持久化线段树+前缀和+二分 [SDOI2010] 粟粟的书架
|
6 / 21 |
8 |
|
|
3947 |
lg2491
D49 树的直径[SDOI2011] 消防
|
2 / 5 |
10 |
|
|
4672 |
lg2498
[SDOI2012] 拯救小云公主
|
1 / 1 |
10 |
|
|
2697 |
lg2511
【二分+DP】[HAOI2008] 木棍分割
|
13 / 36 |
6 |
|
|
2892 |
lg2538
[SCOI2008] 城堡
|
1 / 1 |
10 |
|
|
3067 |
lg2601
[ZJOI2009] 对称的正方形
|
0 / 6 |
10 |
|
|
4319 |
lg2619
*【最小生成树：灵活】[国家集训队] Tree I
|
4 / 16 |
9 |
|
|
743 |
lg2678
[NOIP 2015 提高组] 跳石头
|
52 / 203 |
7 |
